Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 479 Bytes

File metadata and controls

6 lines (5 loc) · 479 Bytes

Minimum Depth of Binary Tree

Attempts:

# Time Complexity Space Complexity Description Submission Runtime (4 trials) Memory (4 trials)
1 O(n) O(n) Use DFS to find minimum height of tree, by compare leaf height and stored min height value Submission 249.75ms 43.53 MB