62,615
社区成员
发帖
与我相关
我的任务
分享
Node buildTree(Node root){
int value = in.nextInt();
if(value == -1){
return null;
}
else{
root = new Node(value);
}
root.left = buildTree(root.left);
root.right = buildTree(root.right);
return root;
}
@Test
public void test() {
BinaryTree tree = new BinaryTree();
Node root =null;
tree.buildTree(root);
tree.preOrder(root);//先序遍历
}
root=tree.buildTree(root);