← Adobe questions

Lowest Common Ancestor in a BST

Filed under Adobe · Also reported at Arcesium, Efftronics, Octro, Teradata

Given a Binary Search Tree (BST) and two nodes, find the lowest common ancestor (LCA) of the two nodes. The LCA is defined as the lowest node in the tree that has both nodes as descendants.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Adobe questions

Collected from public candidate posts and coding forums. Updated Nov 2026.