测试创建 二叉树

package test;


import java.util.ArrayList;


import org.junit.Before;
import org.junit.Test;


import binarytree.BinaryTree;
import binarytree.Node;
public class TestBinaryTree {
BinaryTree bt;
@Before
public void setUp() throws Exception {
bt = new BinaryTree();
}


@Test
public void testBuild() {
ArrayList<Node<Integer,String>> al = new ArrayList<Node<Integer,String>>();
al.add(new Node(1,"1"));
al.add(new Node(2,"2"));
al.add( new Node(4,"4"));
al.add(new Node(null,"null"));
al.add( new Node(null,"null"));
al.add(new Node(5,"5"));
al.add(new Node(null,"null"));
al.add(new Node(null,"null"));
al.add(new Node(3,"3"));
bt.createBinaryTree(al);
bt.perorder();
}


}