*这类二叉树一定是完全二叉树
class ArrayBinaryTree {
public int arr[];
public ArrayBinaryTree(int[] arr) {
this.arr = arr;
}
//重载前序遍历
public void preOrder() {
preOrder(0);
}
//顺序存储二叉树的前序遍历
public void preOrder(int index) {
if (arr == null || arr.length == 0) {
System.out.println("无法遍历");
return;
}
System.out.println(arr[index]);
if (index * 2 + 1 < arr.length)
preOrder(index * 2 + 1);
if (index * 2 + 2 < arr.length)
preOrder(index * 2 + 2);
}
}