二叉数对象测试类

[xuancao]

/**
* @FileName : BiTreeTest
* @Description : 二叉数对象测试类
* @Date : 2004-6-24
* @Author : dalily
*/
import java.util.List;

public class BiTreeTest
{
public static void main(String[] args)
{
BiTreeManager instance = new BiTreeManager();
instance.addNode("A",1,"left");
instance.addNode("B",1,"right");
instance.addNode("C",2,"left");
instance.addNode("D",2,"right");
instance.addNode("E",3,"left");
instance.addNode("F",4,"left");
instance.addNode("G",5,"left");
instance.addNode("H",5,"right");
TreeNode root = BiTree.getRoot();

//先序遍历二叉树(DLR) : 根节点-左节点-右节点
instance.preAccess(root);
List list = instance.getList();

for (int i=0; i<list.size() ; i++)
{
System.out.print(list.get(i));
}
System.out.println();

// 中序遍历二叉树(LDR) : 左节点-根节点-右节点
BiTreeManager instance2 = new BiTreeManager();
instance2.middleAccess(root);
list = instance2.getList();
for (int i=0; i<list.size() ; i++)
{
System.out.print(list.get(i));
}
System.out.println();

//后序遍历二叉树(LRD) : 左节点-右节点-根节点
BiTreeManager instance3 = new BiTreeManager();
instance3.afterAccess(root);
list = instance3.getList();
for (int i=0; i<list.size() ; i++)
{
System.out.print(list.get(i));
}



}
}