Lowest common ancestor BST
Given a binary search tree as a level-order array (None marks a missing child) and two values p and q that are both present, return the value of their lowest common ancestor. Exploit the BST ordering instead of a general-tree LCA: starting at the root, go left when both p and q are smaller than the current node, go right when both are larger, and otherwise the current node is the split point and therefore the LCA. Return the LCA value.
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 20 min
solution.py
InputExpectedGot
[[6,2,8,0,4,7,9,null,null,3,5],2,8]6not run yetsample