顺序存储的二叉树的遍历

package DateStructure;

public class ArrayBinaryTree {
    int[] data;

    public ArrayBinaryTree(int[] data) {
        this.data = data;
    }

    public void frontShow(){
        frontShow(0);
    }

    public void frontShow(int index){
        if (data==null||data.length==0){
            return;
        }
        System.out.println(data[index]);
        if (2*index+1<data.length){
            frontShow(2*index+1);
        }
        if (2*index+2<data.length){
            frontShow(2*index+2);
        }
    }
}

package TestDataStructure;

import DateStructure.ArrayBinaryTree;

public class TestArrayBinaryTree {
    public static void main(String[] args) {
        int[] data = new int[]{1,2,3,4,5,6,7};
        ArrayBinaryTree arrayBinaryTree = new ArrayBinaryTree(data);
        arrayBinaryTree.frontShow();
    }
}