cant we just do....traverse using recursion and instead of printing it just pass to function which is making BST....?? and is this right as someone above said first sort it and then make BST... dont we want that root of both Tree to be same or something like that...??
On Tue, Jul 19, 2011 at 2:17 AM, Dumanshu <duman...@gmail.com> wrote: > @Balaji: for third question, were u asked to write the code? > > On Jul 18, 10:04 pm, Balaji S <balaji.ceg...@gmail.com> wrote: >> wats the mistake.. > > -- > 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. > > -- 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.
