convert the trees to DLL and then merge them to get the combined sorted DLL , now create the AVl tree of that DLL.
On Fri, Jun 3, 2011 at 3:47 PM, Piyush Sinha <[email protected]> wrote: > Do the postorder traversal of the 2nd AVL tree and keep inserting the > value in the 1st AVL tree.Simultaneously go on deleting the same > node...I hope I am clear. > > On 6/3/11, Nate <[email protected]> wrote: >> Given a two balanced binary search trees.Merge both the trees so that >> it will form again a balanced binary search tree. >> >> -- >> 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. >> >> > > > -- > *Piyush Sinha* > *IIIT, Allahabad* > *+91-8792136657* > *+91-7483122727* > *https://www.facebook.com/profile.php?id=100000655377926 * > > -- > 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.
