BST lowest common ancestor
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) → intExamples
in
[[6,2,8,0,4,7,9,null,null,3,5],2,8]out6What 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.
0:00 of about 12 min
solution.py
InputExpectedGot
[[6,2,8,0,4,7,9,null,null,3,5],2,8]6not run yetsample