java 二叉树先序_Java实现二叉树 先序、中序和后序遍历

public classBinaryTree1 {public Node init() {//注意必须逆序建立，先建立子节点，再逆序往上建立，因为非叶子结点会使用到下面的节点，而初始化是按顺序初始化的，不逆序建立会报错

Node J = new Node(8, null, null);

Node H= new Node(4, null, null);

Node G= new Node(2, null, null);

Node F= new Node(7, null, J);

Node E= new Node(5, H, null);

Node D= new Node(1, null, G);

Node C= new Node(9, F, null);

Node B= new Node(3, D, E);

Node A= new Node(6, B, C);return A; //返回根节点

}public voidprintNode(Node node){

System.out.print(node.getData());

}public void theFirstTraversal_Stack(Node root) { //先序遍历

Stack stack = new Stack();

Node node=root;while (node != null || stack.size() > 0) { //将所有左孩子压栈

if (node != null) { //压栈之前先访问

printNode(node);

stack.push(node);

node=node.getLeftNode();

}else{

node=stack.pop();

node=node.getRightNode();

}

}

}public void theInOrderTraversal_Stack(Node root) { //中序遍历

Stack stack = new Stack();

Node node=root;while (node != null || stack.size() > 0) {if (node != null) {

stack.push(node);//直接压栈

node =node.getLeftNode();

}else{

node= stack.pop(); //出栈并访问

printNode(node);

node=node.getRightNode();

}

}

}public void thePostOrderTraversal_Stack(Node root) { //后序遍历

Stack stack = new Stack();

Stack output = new Stack();//构造一个中间栈来存储逆后序遍历的结果

Node node =root;while (node != null || stack.size() > 0) {if (node != null) {

output.push(node);

stack.push(node);

node=node.getRightNode();

}else{

node=stack.pop();

node=node.getLeftNode();

}

}

System.out.println(output.size());while (output.size() > 0) {

printNode(output.pop());

}

}public static voidmain(String[] args) {

BinaryTree1 tree= newBinaryTree1();

Node root=tree.init();

System.out.println("先序遍历");

tree.theFirstTraversal_Stack(root);

System.out.println("");

System.out.println("中序遍历");

tree.theInOrderTraversal_Stack(root);

System.out.println("");

System.out.println("后序遍历");

tree.thePostOrderTraversal_Stack(root);

System.out.println("");

}

}