class BinaryTree{

private Node root;

public void setRoot(Node root) {

this.root = root;

}

public void proOrder(){

if(this.root!=null){

this.root.postOrder();

}else {

System.out.println("二叉树为空");

}

}

public void infixOrder(){

if (this.root!=null){

this.root.infixOrder();

}else {

System.out.println("二叉树为空");

}

}

public void postOrder(){

if (this.root!=null){

this.root.postOrder();

}else {

System.out.println("二叉树为空");

}

}

}

class Node{

private int id;

private String name;

private Node leftNode;

private Node rightNode;

@Override

public String toString() {

return "Node{" +

"id=" + id +

", name='" + name + '\'' +

'}';

}

public Node(int id, String name) {

this.id = id;

this.name = name;

}

public int getId() {

return id;

}

public void setId(int id) {

this.id = id;

}

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public Node getLeftNode() {

return leftNode;

}

public void setLeftNode(Node leftNode) {

this.leftNode = leftNode;

}

public Node getRightNode() {

return rightNode;

}

public void setRightNode(Node rightNode) {

this.rightNode = rightNode;

}

public void preOrder(){

System.out.println(this);

if (this.leftNode!=null){

this.leftNode.preOrder();

}

if (rightNode!=null){

this.rightNode.preOrder();

}

}

public void infixOrder(){

if (this.leftNode!=null){

this.leftNode.infixOrder();

}

System.out.println(this);

if (this.rightNode!=null){

this.rightNode.infixOrder();

}

}

public void postOrder(){

if (this.leftNode!=null){

this.leftNode.postOrder();

}

if (this.rightNode!=null){

this.rightNode.postOrder();

}

System.out.println(this);

}

}