Depth-First Search pattern
Longest Univalue Path
Given the root of a binary tree, return the length, measured in edges, of the longest path where every node along it shares the same value. The path may or may not pass through the root. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 687
- Medium
- 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 687
Medium
The approach
- 01 Recursive DFS (post-order arrows + global max) O(n)O(h) space
What you will learn
- How to read Longest Univalue Path and spot the depth-first search pattern in it
- Recursive DFS (post-order arrows + 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 Longest Univalue Path 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.