Deepest leaves lowest ancestor
Given a binary tree as a level-order list (None marks a missing child; children of None are omitted), return the VALUE of the lowest common ancestor of the set of deepest leaves (the leaves at maximum depth). If there is one deepest leaf, return that leaf's value. For an empty tree return None. All values are distinct.
Implement
lca_deepest_leaves(level: list) → intExamples
in
[[3,5,1,6,2,0,8,null,null,7,4]]out2What 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 30 min
solution.py
InputExpectedGot
[[3,5,1,6,2,0,8,null,null,7,4]]2not run yetsample