// 结点
class Node {
String value;
Node left;
Node right;
public Node() {
}
Node(String value)
{
this.value = value;
}
}
// 先序创建二叉树
public Node create(Node node){
Scanner sc = new Scanner(System.in);
String str = sc.next();
if (str.equals("#")){
node=null;
}else {
node=new Node();
node.value=str;
node.left=create(node.left);
node.right=create(node.right);
}
return node;
}
复制代码
04-05
1508