JAVA实现二叉树前序、中序、后序遍历（迭代方法）

二叉树结构：

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) {
        val = x;
    }
}

• 前序：中左右

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public List<Integer> preorderTraversal(TreeNode root) {
    List<Integer> result = new ArrayList<>();
    Stack<TreeNode> stack = new Stack<>();
    if (root != null) {
        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;
}

另一种写法

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public List<Integer> preorderTraversal(TreeNode root) {
    List<Integer> result = new ArrayList<>();
    Stack<TreeNode> stack = new Stack<>();
    while(!stack.isEmpty() || root!=null){
            while(root!=null){
                result.add(root.val);
                stack.push(root);
                root=root.left;
            }
            root=stack.poll().right;

        }
    return result;
}

• 中序：左中右

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public List<Integer> inorderTraversal(TreeNode root) {
    List<Integer> result = new ArrayList<>();
    Stack<TreeNode> stack = new Stack<>();
    TreeNode cur = root;
    while (cur != null || !stack.isEmpty()) {
        while (cur != null) {
            stack.push(cur);
            cur = cur.left;
        }
        cur = stack.pop();
        result.add(cur.val);
        cur = cur.right;
    }
    return result;
}

• 后序：左右中

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public List<Integer> postorderTraversal(TreeNode root) {
    List<Integer> result = new ArrayList<>();
    Stack<TreeNode> stack = new Stack<>();
    TreeNode prev = null;
    while (root != null || !stack.isEmpty()) {
        while (root != null) {
            stack.push(root);
            root = root.left;
        }
        root = stack.peek();
        if (root.right == null || root.right == prev) {
            result.add(root.val);
            stack.pop();
            prev = root;
            root = null;
        } else {
            root = root.right;
        }
    }
    return result;
}

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public List<Integer> preorderTraversal(TreeNode root) {
    List<Integer> result = new ArrayList<>();
    Stack<TreeNode> stack = new Stack<>();
    if (root != null) {
        stack.push(root);
    }
    while(!stack.isEmpty()) {
            TreeNode node = stack.poll();
            result.addFirst(node.val);
            if (null != node.left) {
                stack.push(node.left);
            }
            if (null != node.right) {
                stack.push(node.right);
            }
        }
    return result;
}