Approach 1: BFS
- Time:O(n)
- Space:O(h)
C++ |
---|
|
JAVA |
---|
|
Approach 2: DFS (Overflow)
- Time:O(n)
- Space:O(n)
C++ |
---|
|
C++ |
---|
|
JAVA |
---|
|
C++ |
---|
|