importjava.util.Stack;importjava.util.HashMap;public classBinTree {private chardate;privateBinTree lchild;privateBinTree rchild;public BinTree(charc) {
date=c;
}//先序遍历递归
public static voidpreOrder(BinTree t) {if (t == null) {return;
}
System.out.print(t.date);
preOrder(t.lchild);
preOrder(t.rchild);
}//中序遍历递归
public static voidInOrder(BinTree t) {if (t == null) {return;
}
InOrder(t.lchild);
System.out.print(t.date);
InOrder(t.rchild);
}//后序遍历递归
public static voidPostOrder(BinTree t) {if (t == null) {return;
}
PostOrder(t.lchild);
PostOrder(t.rchild);
System.out.print(t.date);
}//先序遍历非递归
public static voidpreOrder2(BinTree t) {
Stack s = new Stack();while (t != null || !s.empty()) {while (t != null) {