← IBM questions

Lowest Common Ancestor in BST

Filed under IBM · Also reported at Bloomberg, Espressif Systems, Tally Solutions

Given a Binary Search Tree (BST) and two distinct values of nodes within the tree, find the Lowest Common Ancestor (LCA) of the two nodes. The LCA is defined as the lowest node in the tree that has…

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 IBM questions

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