convert the binary search tree into a sorted linked list. After flattening construct the tree out of it.
And please don't use capital letters unnecessarily. It reflects bad on you. On Sun, Sep 11, 2011 at 7:29 AM, teja bala <pawanjalsa.t...@gmail.com>wrote: > MERGE 2 BINARY SEARCH TREES? > > > HOW TO DO IT?(POST AN EFFICIENT ALGORITHM) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > > -- S.Nishaanth, Computer Science and engineering, IIT Madras. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
