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.
I solved this problem. But if its authors read this forum, I would like to point out that I wish the probem was defined more rigorously. It is ambiguous what if there are many equal elements, e.g.
4
4 5
v1=4, v2=4, ans - ?
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 →
I solved this problem. But if its authors read this forum, I would like to point out that I wish the probem was defined more rigorously. It is ambiguous what if there are many equal elements, e.g.
4 4 5
v1=4, v2=4, ans - ?