java复习之顺序二叉树的实现

java复习之顺序二叉树的实现

package learn.tree;

import java.util.Enumeration;

/**
 * 顺序存储二叉树
 */
public class ArrayTree {
    public static void main(String[] args) {
        int[] array = {1,2,3,4,5,6,7,8};
        ArrayT arrayT = new ArrayT(array);
        arrayT.method(0);
    }
}
class ArrayT{
    private  int[] num;

    public ArrayT(int[] num) {
        this.num = num;
    }
    public  void method(int index){
        if (num==null|| num.length==0){
            System.out.println("啥也不是");
            return;
        }
        System.out.println(num[index]);
        if(2*index+1<num.length){
            method(2*index+1);
        }
        if(2*index+2<num.length){
            method(2*index+2);
        }

    }
}