Binary Tree Postorder Traversal

Given the root of a binary tree, return the postorder traversal of its nodes' values. Postorder traversal visits nodes in the order: left, right, root.

Constraints

  • The number of the nodes in the tree is in the range [0, 100].
  • -100 <= Node.val <= 100
View editorial solution
Saving… · 9 lines
# 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 binaryTreePostorderTraversal(self, root: TreeNode) -> List[int]:
Console

Click Run to execute sample tests.