Coding

Find the lowest common ancestor of a binary tree.

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. The LCA is defined between two nodes p and q as the lowest node in the tree that has both p and q as descendants.

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4

Output: 5

Explanation: Node 4 is a direct descendant of Node 5 in the tree, making Node 5 the lowest common ancestor of both.

Was asked at

Practice this question with AI

First session is free - no credit card required.

Go Premium

More interviews, more skills, more success.

No answers yet

Be the first to share your approach to this question

Practice More Questions

Interview question asked to Software Engineers interviewing at AT&T, Jolt.io, GetYourGuide and other companies. Original question asked: Find the lowest common ancestor of a binary tree..