package sort;
public class Test37 {
public static void main(String[] args) {
int deepth = 2;
// int rootvalue=1;
BinayTreeNode root = new BinayTreeNode(1, null, null);
makeTree(root, deepth);
printTree(root);
}
public static void printTree(BinayTreeNode root) {
if (root != null) {//使用先序遍历遍历二叉树
System.out.print(root.value);//根左右
printTree(root.left);
printTree(root.right);
} else {
System.out.print("$");//空节点直接输出$
}
}
private static void makeTree(BinayTreeNode node, int deep) {
// TODO Auto-generated method stub
if (deep > 0) {
node.left = new BinayTreeNode(node.value * 2, null, null);
node.right = new BinayTreeNode(node.value * 2 + 1, null, null);
makeTree(node.left, deep - 1);
makeTree(node.right, deep - 1);
}
}
}