java顺序树(含java顺序树代码)

目录

一：Java顺序树介绍

二：java顺序树的代码

---

一：Java顺序树介绍

顺序存储二叉树是完全二叉树

二：java顺序树的代码

package tree;

public class ArrayBinaryTree {
	
	private int[] arrays;
	
	public ArrayBinaryTree(int[] arr) {
		this.arrays = arr;
	}
	
	//前序遍历顺序存储二叉树
	public void preSelect(int index) {
		if(this.arrays == null || arrays.length == 0) {
			System.out.println("存储数组为空...");
		}
		System.out.print(arrays[index]);
		if((index * 2  + 1) < arrays.length) {
			preSelect(index * 2 + 1);
		}
		if((index * 2  + 2) < arrays.length) {
			preSelect(index * 2 + 2);
		}
	}
}

package tree;

public class ArrTreeTest {
	public static void main(String[] args) {
		int[] arr = new int[] {1,2,3,4,5,6};
		ArrayBinaryTree at = new ArrayBinaryTree(arr);
		at.preSelect(0);
	}

}