Depth-First Search pattern
Maximum Depth of Binary Tree
Given the root of a binary tree, return its maximum depth: the number of nodes along the longest path from the root down to the farthest leaf. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 104
- Easy
- 1 approach
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
Depth-First SearchLeetCode 104
Easy
The approach
- 01 Recursive DFS (post-order) O(n)O(h) space
What you will learn
- How to read Maximum Depth of Binary Tree and spot the depth-first search pattern in it
- Recursive DFS (post-order): O(n) time, O(h) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Depth-First Search
See Maximum Depth of Binary Tree run, step by step
Sign in and this page opens on the animation, with all 18 Depth-First Search problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.