what would be the complexity of your solution O(n) or O(log n)..? On Sat, Aug 20, 2011 at 12:19 PM, sukran dhawan <[email protected]>wrote:
> traverse bst inorder and each time u encounter a node find the difference > between the element and given element in question . if the absolute > difference is minimum after traversing the tree that is the element . u can > getback the element using another element which keeps sign of the element so > that original element can be obtained from diff > > On Sat, Aug 20, 2011 at 12:15 PM, Abhishek Yadav < > [email protected]> wrote: > >> Given a BST and a number, Find the closest node to that number in the >> BST. Give an algorithm for that. >> Let there be binary search tree having nodes with values >> 12,34,64,23,64,25,76,6 and the number given is 28, then the answer >> would be 25 as it is the closest node. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
