二叉树迭代遍历

定义

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {
    }
    TreeNode(int val) {
        this.val = val;
    }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

前序

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        LinkedList<TreeNode> stack = new LinkedList<>();
        List<Integer> res = new ArrayList<>();
        TreeNode cur=root;
        while (cur != null || !stack.isEmpty()) {
            while (cur != null) {
            	//与中序仅有这行代码不同
                res.add(cur.val);
                stack.addLast(cur);
                cur = cur.left;
            }
            cur = stack.removeLast();
            cur = cur.right;
        }
        return res;
    }
}

中序

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        LinkedList<TreeNode> stack = new LinkedList<>();
        List<Integer> res = new ArrayList<>();
        TreeNode cur=root;
        while (cur != null || !stack.isEmpty()) {
            while (cur != null) {
                stack.addLast(cur);
                cur = cur.left;
            }
            cur = stack.removeLast();
            res.add(cur.val);
            cur = cur.right;
        }
        return res;
    }
}

后序

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        LinkedList<TreeNode> stack = new LinkedList<>();
        TreeNode cur = root;
        TreeNode prev = null;
        while (cur != null || !stack.isEmpty()) {
            while (cur != null) {
                stack.addLast(cur);
                cur = cur.left;
            }
            cur = stack.peekLast();
            //右子树为空，或者等于prev（已经便利过）就该将根结点加入
            if (cur.right == null || cur.right == prev) {
                res.add(cur.val);
                stack.removeLast();
                prev = cur;
                //不将cur=null，会导致前面的while一直添加cur
                cur = null;
            } else {
                cur = cur.right;
            }
        }
        return res;
    }
}

层序

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        if (root == null) {
            return res;
        }
        LinkedList<TreeNode> queue = new LinkedList<>();
        queue.addLast(root);
        while (!queue.isEmpty()) {
            List<Integer> tmp = new ArrayList<>();
            int num = queue.size();
            for (int i = 0; i < num; i++) {
                TreeNode node = queue.removeFirst();
                tmp.add(node.val);
                if (node.left != null) {
                    queue.addLast(node.left);
                }
                if (node.right != null) {
                    queue.addLast(node.right);
                }
            }
            res.add(tmp);
        }
        return res;
    }
}