← Questions
Lowest common ancestor in a BST and in a binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given two nodes, return their lowest common ancestor first in a binary search tree, using the ordering, and then in a plain binary tree where you cannot rely on it. Explain both recursions, the iterative BST version, and what changes if a node might be missing from the tree.
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