Leetcode-145. Binary Tree Postorder Traversal 二叉树的后序遍历 -python

题目

给定一个二叉树，返回它的 后序 遍历。
链接：https://leetcode.com/problems/binary-tree-postorder-traversal/

Given a binary tree, return the postorder traversal of its nodes’ values.

Example:

Input: [1,null,2,3]
1
\
2
/
3
Output: [3,2,1]

思路及代码

• 前序遍历
• 中序遍历
• 后序遍历

1. DFS

# 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]:
        def dfs(node):
            if not node:
                return
            dfs(node.left)
            dfs(node.right)
            ans.append(node.val)
        
        ans = []
        dfs(root)
        return ans

2. Iteration

class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        ans = []
        if not root:
            return ans
        stack = [root]
        while stack:
            n = stack.pop()
            ans.insert(0, n.val)
            if n.left:
                stack.append(n.left)
            if n.right:
                stack.append(n.right)
        return ans

复杂度

T = $O(n)$
S = $O(n)$