LinkedIn Org Chart LCA in BST
LinkedIn Org Chart LCA in BST
MediumTrees9% accepted
LinkedIn models its org chart as a BST where each node represents an employee ID. Given the root of a BST and two employee IDs p and q, find their Lowest Common Ancestor (LCA). The LCA is the deepest node that has both p and q as descendants (a node can be a descendant of itself).
Approach
Find the Lowest Common Ancestor of two nodes in a BST.
Input
6
6 2 8 0 4 7 9
2 8
Output
6
More Trees problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards