← Oracle questions

Lowest Common Ancestor in a Tree

Filed under Oracle · Also reported at Netskope, Wize Commerce

Given a binary tree and two nodes p and q, find the lowest common ancestor (LCA) of the two nodes. The LCA is defined as the lowest node in the tree that has both p and q 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 Oracle questions

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