数据结构二叉树的三种遍历方式

package com.test;


public class Node {
public String data;
public Node lchid;
public Node rchid;


public Node(String data, Node lchid, Node rchid) {
this.data = data;
this.lchid = lchid;
this.rchid = rchid;
}


}package com.test;


import java.util.ArrayList;
import java.util.List;
import com.test.Node;
public class Tree {
public  Node root;
private List<Node> list = new ArrayList<Node>();


public Tree() {
init();
}


public void init() {
Node x = new Node("X", null, null);
Node y = new Node("Y", null, null);
Node d = new Node("d", x, y);
root = d;
}


public void preorder(Node node) {
list.add(node);
if (node.lchid != null) {
preorder(node.lchid);
}
if (node.rchid != null) {
preorder(node.rchid);
}
}


public void middleorder(Node node) {
if (node.lchid != null) {
middleorder(node.lchid);
}
list.add(node);
if (node.rchid != null) {
middleorder(node.rchid);
}


}
public  void afterorder(Node node){
if(node.lchid!=null){
afterorder(node.lchid);
}
if(node.rchid!=null){
afterorder(node.rchid);
}
list.add(node);
}
public List<Node> getResult(){
return list;

}
public static void main(String[] args) {
Tree tree=new Tree();
//tree.afterorder(tree.root);
tree.middleorder(tree.root);
for(Node node:tree.getResult()){
System.out.println(node.data);
}
}
}