#145

Binary Tree Postorder Traversal

newbie · 195 · lc easy +16 · 77.7% accepted · 7,763 likes · top 89%

Description

Given the root of a binary tree, return its node values collected in postorder (left subtree, then right subtree, then root).

Code

# 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]:

# 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]: