LeetCode-145-二叉树的后序遍历

最新推荐文章于 2022-05-29 13:27:49 发布

LQZme

最新推荐文章于 2022-05-29 13:27:49 发布

阅读量94

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/LQZme/article/details/108873394

版权

LeetCode 专栏收录该内容

73 篇文章 0 订阅

订阅专栏

145. 二叉树的后序遍历

说明

给定一个二叉树，返回它的后序遍历。

示例

输入: [1,null,2,3]  
   1
    \
     2
    /
   3 

输出: [3,2,1]

题解思路

1、递归
2、迭代，利用栈

代码实现

1、递归
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        ans = []
        def dfs(root):
            if not root:
                return None
            dfs(root.left)
            dfs(root.right)
            ans.append(root.val)
        dfs(root)
        return ans


2、迭代
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return None
        ans = []
        stack = []
        tmp = None
        while root or stack:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            if not root.right or root.right == tmp:
                ans.append(root.val)
                tmp = root
                root = None
            else:
                stack.append(root)
                root = root.right
        return ans