package text.java;

public class BinaryTreeTest {
    public static void main(String[] args) {
        char[] ch = {'A', 'C', '#', 'B', 'D', '#', '#', '#', 'E', '#', 'F', '#', '#'};

        CreateBinaryTree a = new CreateBinaryTree();
        BinaryTreeNode root = new BinaryTreeNode();
        root = a.add(ch);//构造二叉树
        System.out.println("层序遍历:");
        CreateBinaryTree.level(root);
    }
}