采用递归的方法创建二叉树,可以灵活地创建任意形态的二叉树,这里用先序递归举例,中序和后序同理。
首先贴一下Node节点类,大同小异。
public class Node {
private int data;
private Node lchild;
private Node rchild;
public int getData() {
return data;
}
public void setData(int data) {
this.data = data;
}
public Node getLchild() {
return lchild;
}
public void setLchild(Node lchild) {
this.lchild = lchild;
}
public Node getRchild() {
return rchild;
}
public void setRchild(Node rchild) {
this.rchild = rchild;
}
public Node(int data, Node lchild, Node rchild) {
super();
this.data = data;
this.lchild = lchild;
this.rchild = rchild;
}
@Override
public String toString() {
return "Node [data=" + data + ", lchild=" + lchild + ", rchild="
+ rchild