We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Neat code. I think this is in case of an ordered tree where lt < root < rt.
If this was not the case, I think using Queue to push the children; level by level would solve it.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Binary Search Tree : Lowest Common Ancestor
You are viewing a single comment's thread. Return to all comments →
Neat code. I think this is in case of an ordered tree where lt < root < rt. If this was not the case, I think using Queue to push the children; level by level would solve it.