Practice Binary Tree Postorder Traversal
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given the root of a binary tree, return the postorder traversal of its nodes' values.
Source: Binary Tree Postorder Traversal on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [1,null,2,3]
Output
[3,2,1]
# Example 2
Input
root = [1,2,3,4,5,null,8,null,null,6,7,9]
Output
[4,6,7,5,2,9,8,3,1]
# Example 3
Input
root = []
Output
[]
# Example 4
Input
root = [1]
Output
[1]
Constraints
The number of the nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100
Related LeetCode Problems
Practice more problems similar to Binary Tree Postorder Traversal.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.