TreeNode rightNode;
public TreeNode(int data, TreeNode leftNode, TreeNode rightNode) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = rightNode;
}
public TreeNode(int data) {
this.data = data;
}
public int getData() {
return data;
}
public void setData(int data) {
this.data = data;
}
public TreeNode getLeftNode() {
return leftNode;
}
public void setLeftNode(TreeNode leftNode) {
this.leftNode = leftNode;
}
public TreeNode getRightNode() {
return rightNode;
}
public void setRightNode(TreeNode rightNode) {
this.rightNode = rightNode;
}
}
//先序遍历——递归方法
public static void preOrder(TreeNode root) {
if (root != null) {
System.out.print(root.data + "\t");
preOrder(root.leftNode);
preOrder(root.rightNode);
}
}
//先序遍历——非递归方法
public static voi