Return the lowest common ancestor value of p and q. Helper classes (ListNode / TreeNode, build_list, to_list, build_tree) are preloaded for you.
Input: t = build_tree([6, 2, 8, 0, 4, 7, 9, None, None, 3, 5]) print(lca_bst(t, 2, 8), lca_bst(t, 2, 4)) Output: 6 2
Your program must print exactly this output for these test calls.
both values exist in the tree
Solve it in the live editor on this page — run on sample data, then submit against hidden tests.
‹ Kth Smallest in a BST · Lowest Common Ancestor of a Binary Tree ›
{{ totalCount }} questions · {{ shHardPct }}% Hard. Data structures & algorithms interview problems in 13 patterns. Solve in Python, JavaScript or Java in your browser, run sample tests, then submit against hidden tests.
Guests can solve {{ freeLimit }} problems for free. Log in or sign up (free) to unlock everything, keep your streak and appear on the leaderboard. New to a topic? Learn it first in the DSA course.
{{ p.statement }}
{{ p.constraints }}
No submissions yet. Press Submit to judge your code against all tests.
The model solution and step-by-step explanation unlock when you solve this problem or after 3 unsuccessful submissions ({{ shFailsLabel }}). Struggling? Try the hints on the Question tab first.
{{ solutionCode }}
Create your free TechTown account to unlock every problem, track your progress, bookmark questions and keep preparing for interviews.