二叉树的迭代遍历

最新推荐文章于 2024-09-29 16:46:50 发布

ceresyezi

最新推荐文章于 2024-09-29 16:46:50 发布

阅读量40

点赞数

分类专栏：刷题总结 # 二叉树文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/qq_41830037/article/details/130270112

版权

刷题总结同时被 2 个专栏收录

110 篇文章 0 订阅

订阅专栏

二叉树

10 篇文章 0 订阅

订阅专栏

该文介绍了如何使用迭代方法进行二叉树的前序、中序和后序遍历。通过维护一个栈，可以有效地遍历树的节点，分别在不同的阶段添加左子节点和右子节点到栈中，以实现不同的遍历顺序。最后，对于后序遍历，需要对结果列表进行反转以得到正确的顺序。

摘要由CSDN通过智能技术生成

题目要求

二叉树的迭代遍历

前序遍历

    public List<Integer> preorderTraversal(TreeNode root) {
        Deque<TreeNode> stack = new ArrayDeque<>();
        List<Integer> res = new ArrayList<>();
        if (root == null) return res;
        stack.push(root);
        while (!stack.isEmpty()) {
            TreeNode cur = stack.pop();
            res.add(cur.val);
            // 入栈时是右左，出栈是才是左右
            if (cur.right != null) stack.push(cur.right);
            if (cur.left != null) stack.push(cur.left);
        }
        return res;
    }

中序遍历

/**
 * Definition for a binary tree node.
 * public 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> inorderTraversal(TreeNode root) {
        Deque<TreeNode> stack = new ArrayDeque<>();
        List<Integer> res = new ArrayList<>();
        TreeNode cur = root;
        while (!stack.isEmpty() || cur != null) {
            if (cur != null) {
                stack.push(cur);
                cur = cur.left;
            } else {
                cur = stack.pop();
                res.add(cur.val);
                cur = cur.right;
            }
        }
        return res;
    }
}

后序遍历

/**
 * Definition for a binary tree node.
 * public 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> postorderTraversal(TreeNode root) {
        Deque<TreeNode> stack = new ArrayDeque<>();
        List<Integer> res = new ArrayList<>();
        if (root == null) return res;
        stack.push(root);
        while (!stack.isEmpty()) {
            TreeNode cur = stack.pop();
            res.add(cur.val);
            if (cur.left != null) stack.push(cur.left);
            if (cur.right != null) stack.push(cur.right);
        }
        Collections.reverse(res);
        return res;
    }
}