【LeetCode】 143 二叉树的后序遍历

最新推荐文章于 2024-10-05 12:29:44 发布

JaneRoad

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量117

点赞数

文章标签：二叉树 leetcode docker dfs nginx

本文链接：https://blog.csdn.net/ChrisLu777/article/details/114366747

版权

题目：

解题思路：

https://leetcode-cn.com/problems/binary-tree-postorder-traversal/solution/er-cha-shu-de-hou-xu-bian-li-by-leetcode-solution/

代码：

import java.util.*;

public class LC6 {

    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> ans = new ArrayList<>();
        Stack<TreeNode> s = new Stack<>();
        Set<TreeNode> seen = new HashSet<>();
        while (root != null || !s.isEmpty()) {
            if (root == null && seen.contains(s.peek())) {
                ans.add(s.pop().val);
            } else if (root == null) {
                seen.add(s.peek());
                root = s.peek().right;
            } else {
                s.push(root);
                root = root.left;
            }
        }
        return ans;
    }

}