Given a binary search tree of n nodes, find two nodes whose sum is equal to > a given number k in O(n) time and constant space. > (ignoring recursion stack space) > > I have got O(nlogn) time , O(1) space and O(n) time, O(n) space. Please > help me out with O(n) time and O(1) space. > > > -- > 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.
