二叉树非递归遍历

package test;


public class Tree {
private class Node{
private Node left;
private Node right;
private int data;
public Node(int data){
this.data=data;
}
}
private int len;
private Node t[];
private Node stack[];
private int stack0[];
private int top = -1;

public Tree(int len){
this.len = len;
}

//前序访问
private void preVisit(Node t){
if(t != null){
Node p = t;
do{
while(p!=null ){
visit(p);
stack[++top]=p;
p = p.left;
}
p = stack[top--];
p = p.right;
}while(top!=-1 || p!=null);
}
}

//中序访问
private void midVisit(Node t){
if(t != null){
Node p = t;
do{
while(p!=null){
stack[++top] = p;
p = p.left;
}
p = stack[top--];
visit(p);
p = p.right;
}while(top!=-1 || p!=null);
}
}

//后序访问
private void afterVisit(Node t){
if(t!=null){
Node p = t;
do{
while(p!=null){
stack[++top] = p;
stack0[top] = 0;
p = p.left;
}
p = stack[top];
int flag = stack0[top--];
if(flag == 0){
stack[++top] = p;
stack0[top] = 1;
p = p.right;
}else{
visit(p);
p = null;
}
}while(p!=null || top!=-1);
}
}

private void visit(Node p){
char info[] = {'A','B','C','D','E','F','G','H'};
System.out.print(info[p.data]);
}

private void inital(){
stack = new Node [len];
stack0  = new int [len];

t = new Node[len];
for(int i = 0; i < len; i++){
t[i] = new Node(i);
}
t[0].left = t[1];
t[0].right = t[2];
t[1].left = t[3];
t[1].right = t[4];
t[2].left = t[5];
t[2].right = null;
t[3].left = null;
t[3].right = null;
t[4].left = t[6];
t[4].right = null;
t[5].left = null;
t[5].right = t[7];
t[6].left = null;
t[6].right = null;
t[7].left = null;
t[7].right = null;
}

public static void main(String args[]){
Tree t = new Tree(8);
t.inital();
t.preVisit(t.t[0]);
t.midVisit(t.t[0]);
t.afterVisit(t.t[0]);
}
}