| # | Time Complexity | Space Complexity | Description | Submission | Runtime (4 trials) | Memory (4 trials) |
|---|---|---|---|---|---|---|
| 1 | O(n) | O(h), h = Tree height | Use Deapth-First Search (DFS) on both left and right substrees and compare the symmetry | Submission | 35.5 ms | 16.6 MB |
| # | Time Complexity | Space Complexity | Description | Submission | Runtime (4 trials) | Memory (4 trials) |
|---|---|---|---|---|---|---|
| 1 | O(n) | O(h), h = Tree height | Use Deapth-First Search (DFS) on both left and right substrees and compare the symmetry | Submission | 35.5 ms | 16.6 MB |