145. 二叉树的后序遍历

芒果香菠菠

于 2024-01-04 22:14:45 发布

阅读量345

点赞数 7

文章标签： python

本文链接：https://blog.youkuaiyun.com/weixin_42396719/article/details/135397329

版权

# 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: Optional[TreeNode]) -> List[int]:
        if not root:
            return []

        left = self.postorderTraversal(root.left)
        right = self.postorderTraversal(root.right)

        return left + right + [root.val]