1.非递归遍历二叉树
非递归实现需要手动控制压栈的过程,目的既要保证每个节点都访问到且能有效控制程序结束
//先序遍历 先push right再push left,目的是先处理left节点 弹栈就打印
public static void prefix(Node node) {
System.out.print("pre-order: ");
Stack<Node> stack = new Stack<>();
stack.push(node);
while (!stack.empty()) {
node = stack.pop();
System.out.print(node.val + " ");
if (node.right != null) {
stack.push(node.right);
}
if (node.left != null) {
stack.push(node.left);
}
}
System.out.println();
}
//中序遍历: 只要left不为null一直往左窜直到null,并将沿途经过的节点压入栈,
//然后弹出即打印,再往右窜,不为空就往左窜,压栈...
public static void infill(Node node) {
System.out.print("infill-order: ");
Stack<Node> stack = new Stack<>();
//先不急压入头节点
while (!stack.isEmp