Leetcode Problem 107. Binary Tree Level Order Traversal II
Leetcode Solutions
Approach: Recursion: DFS Preorder Traversal
- Define a helper function that takes a node and its level as arguments.
- If the node is not null, check if the current level is already present in the levels list.
- If not, add a new list to levels.
- Append the node's value to the list corresponding to its level.
- Recursively call the helper function for the left child, incrementing the level by 1.
- Recursively call the helper function for the right child, incrementing the level by 1.
- After the recursion completes, reverse the levels list to get the bottom-up order.
- Return the reversed levels list.
Approach: Iteration: BFS Traversal
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...