← Questions
Lowest common ancestor in an N-ary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given the root of an N-ary tree and two of its nodes, return their lowest common ancestor. Use one depth-first pass in which each subtree reports whether it contains each of the two nodes.
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