Approach 1: Top-down DFS
- Time:O(n)
- Space:O(h)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Bottom-up BFS
- Time:O(n)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|