Question

How would anyone convert a array based tree into per-order? The array contains:

Cheers

public void preOrder(int index) {

    if (index >= currSize) {
        return;
    }

    System.out.println(items[index]);
    preOrder(2 ^ index + 1); //left
    preOrder((2 ^ index) + 2); //right
}

Answer 1

Should be like the following.

public void preOrder(int index) {

    if (index >= currSize) {
        return;
    }
    System.out.println(items[index]);
    preOrder((2 * index)+1);
    preOrder((2 * index)+2);
 }