Lowest Common Ancestor of Deepest Leaves (LeetCode 1123)
MediumLeetCode 1123 · LCA & Ancestors · Google, Amazon +2 · 42:25Lowest Common Ancestor of Deepest Leaves · Smallest Subtree with all the Deepest Nodes · 1123 · 865My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 1123 Lowest Common Ancestor of Deepest Leaves by codestorywithMIK: Trees, Medium. Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree, Binary Lifting, Lowest Common Ancestor, DP on Trees
- Patterns
- LCA & Ancestors, General Recursion on Trees
- Chapter
- Trees
- Duration
- 42:25
Related problems
- Time Needed to Inform All Employees (LeetCode 1376)
- Lowest Common Ancestor of a Binary Tree (LeetCode 236)
- Find Leaves Of Binary Tree (LeetCode 366)
- Binary Tree Pruning (LeetCode 814)
- Count Complete Tree Nodes -(Amazon, Microsoft, Salesforce, Meta) : Explanation ➕ Live Coding (LeetCode 222)
- Leaf-Similar Trees (LeetCode 872)
- Maximum Difference Between Node and Ancestor (LeetCode 1026)
- Maximum Product of Splitted Binary Tree (LeetCode 1339)