Practice Binary Tree Level Order Traversal II
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 bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).
Source: Binary Tree Level Order Traversal II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [3,9,20,null,null,15,7]
Output
[[15,7],[9,20],[3]]
# Example 2
Input
root = [1]
Output
[[1]]
# Example 3
Input
root = []
Output
[]
Constraints
The number of nodes in the tree is in the range [0, 2000].
-1000 <= Node.val <= 1000
Related LeetCode Problems
Practice more problems similar to Binary Tree Level Order Traversal II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.