二叉树遍历

private static void printTree2(Node tree) {
Stack<Node> s = new Stack<Node>();
while (tree != null || !s.isEmpty()) {
while (tree != null) {
System.out.println(tree.value);
s.push(tree);
tree = tree.left;
}
tree = s.pop();
tree = tree.right;
}
}


private static void printTree(Node tree) {
if (tree == null) {
return;
} else {
System.out.println(tree.value);

printTree(tree.left);
System.out.println("Tree left");

printTree(tree.right);
System.out.println("Tree right");
}
}