test.java

1. 用一个一维数组保存二叉树结点。 2. 实现二叉树节点的返回左孩子

import java.util.Scanner;

public class Test {
	public static void main(String[] args)
	{
		System.out.println("测试二叉树类ArrayTree: ");
		
		ArrayTree tree=new ArrayTree();
		for(int i=1;i<10;i++)
		{
			tree.insert(i, i);
		}
		
		System.out.println("按层遍历二叉树:");
		tree.display();
		System.out.println("返回二叉树根节点:");
		System.out.println(tree.root());
		System.out.println("返回第3个结点的左孩子:");
		System.out.println(tree.left(3));
		System.out.println("返回第3个结点的右孩子:");
		System.out.println(tree.right(3));
		System.out.println("返回第6个结点的右孩子:");
		System.out.println(tree.right(6));
		
		System.out.println("");
		System.out.println("测试二叉树类BitTree: ");
		
		BitTree t=new BitTree();
		
		Scanner scan=new Scanner(System.in);
		
		t.root=t.preOrderCreate(scan);
		t.preOrder(t.root);
			System.out.print("\n");	
		t.inOrder(t.root);
			System.out.print("\n");	
		t.postOrder(t.root);
			System.out.print("\n");
		
	}

}