[algogeeks] Re: GIVE AN ALGORITHM TO MERGE 2 BINARY SEARCH TREES

[Bruno Avila]

Look to the problem as merge of two sorted array, thus, use the same technique the merge sort uses (linear time).

Regards,
Bruno

On 8/4/06, deadlock <[EMAIL PROTECTED]> wrote:

How to basically merge the two BST??



--~--~---------~--~----~------------~-------~--~----~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

• Previous message
• View by thread
• View by date
• Next message

• [algogeeks] GIVE AN ALGORITHM TO MERGE 2 BINARY SEARCH TREES deadlock
• • [algogeeks] Re: GIVE AN ALGORITHM TO MERGE 2 BINARY SEARC... Bruno Avila

Reply via email to