← Goldman Sachs questions

LCA in Binary Search Tree

Filed under Goldman Sachs

Given a Binary Search Tree (BST) and two nodes, find the Lowest Common Ancestor (LCA) of the two nodes.

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 Goldman Sachs questions

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