CodingEasycod-g770

Subject Lowest common ancestorLevel Entry–Mid~12 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a binary search tree encoded as a level-order array (null for missing) and two values p and q that are both guaranteed to exist in the tree, return the value of their lowest common ancestor. Exploit the BST ordering to find it without a full traversal.

Implement

lca_bst(level: list, p: int, q: int) → int

Examples

in[[6,2,8,0,4,7,9,null,null,3,5],2,8]out6

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.