Depth-First Search pattern
Diameter of a Binary Tree
Given the root of a binary tree, return the length of its diameter: the number of edges on the longest path between any two nodes, which need not pass through the root. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 543
- 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 543
Easy
The approach
- 01 Recursive DFS (post-order height + global max) O(n)O(h) space
What you will learn
- How to read Diameter of a Binary Tree and spot the depth-first search pattern in it
- Recursive DFS (post-order height + global max): 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 Diameter of a 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.