二叉树遍历迭代写法

1. 前序遍历

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        if (root == null) {
            return result;
        }
  
  // 定义栈
        Stack<TreeNode> stack = new Stack<>();
        // 根节点入栈
        stack.push(root);
        // 遍历二叉树
        while (!stack.isEmpty()) {
         // 保存根节点
            TreeNode node = stack.pop();
            result.add(node.val);
            
            // 判断是否存在右子树，存在则入栈
            if (node.right != null) {
                stack.push(node.right);
            }
            // 判断是否存在左子树，存在则入栈
            if (node.left != null) {
                stack.push(node.left);
            }
        }
        // 返回前序遍历的结果
        return result;
    }
}

2. 中序遍历

public static void inOrderIteration(TreeNode head) {
 if (head == null) {
  return;
 }
 TreeNode cur = head;
 Stack<TreeNode> stack = new Stack<>();
 while (!stack.isEmpty() || cur != null) {
  while (cur != null) {
   stack.push(cur);
   cur = cur.left;
  }
  TreeNode node = stack.pop();
  System.out.print(node.value + " ");
  if (node.right != null) {
   cur = node.right;
  }
 }
}

3. 后序遍历

public static void postOrderIteration2(TreeNode head) {
 if (head == null) {
  return;
 }
 TreeNode cur = head;
 Stack<TreeNode> stack = new Stack<>();
 stack.push(head);
 while (!stack.isEmpty()) {
  TreeNode peek = stack.peek();
  if (peek.left != null && peek.left != cur && peek.right != cur) {
   stack.push(peek.left);
  } else if (peek.right != null && peek.right != cur) {
   stack.push(peek.right);
  } else {
   System.out.print(stack.pop().val + " ");
   cur = peek;
  }
 }
}