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.
but i tried tracing the path from root to key1 and taken this path into a queue. did the same for key2
and returned the last common integer among the two queues.
complex right?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Binary Search Tree : Lowest Common Ancestor
You are viewing a single comment's thread. Return to all comments →
that's very brilliant.
but i tried tracing the path from root to key1 and taken this path into a queue. did the same for key2 and returned the last common integer among the two queues.
complex right?