Back
Lowest Common Ancestor
Question 1 of 128% Complete
Easy
LCA in a BST (iterative)
Return LCA by walking down using values.
def lca_bst(root, p, q):
a, b = min(p.val, q.val), max(p.val, q.val)
cur = root
while cur:
if b < cur.val:
cur = cur.left
elif a > cur.val:
cur = cur.right
else:
return cur
Need a hint?
Stop when split occurs or equals root.