@Manjunath : We can't assume the structure of BST has parent pointers , if that is explicitly mentioned , then we will have to keep in mind two pointers one for inorder successor in the left subtree and another for inorder predecessor in the right subtree and traverse the pointers to find the given sum.
-- Thanks & Regards, Priyanka Chatterjee Final Year Undergraduate Student, Computer Science & Engineering, National Institute Of Technology,Durgapur India http://priyanka-nit.blogspot.com/ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
