← Questions
Lowest common ancestor in a binary search tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a binary search tree and two distinct keys that are both in it, return their lowest common ancestor: the deepest node whose subtree contains both. A node's subtree includes the node itself. Use the tree's ordering rather than searching every node.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding