@ shingray ... cartesian trees are not BSTs . I guess nirmal's question asks for a BST. also cartesian trees have extra space requirements.
On Fri, Jan 29, 2010 at 12:07 AM, naga vinod kumar <[email protected] > wrote: > hi varun ,it cant be in O(n) time ,it can be merged in O(nlogn) time. > > > On Thu, Jan 28, 2010 at 10:37 PM, Varun S V <[email protected]> wrote: > >> Delete the nodes in the second BST in postorder. As and when you delete >> this node, insert it into the first BST. >> >> >> >> On Thu, Jan 28, 2010 at 9:35 PM, Bijlwan <[email protected]> wrote: >> >>> hey nirmal . i don't get that when you merge the two linked list , >>> how do you get the BST? >>> making the BST would itself be a O(nlogn) process? >>> >>> On Jan 28, 5:03 am, Nirmal <[email protected]> wrote: >>> > Given two binary search trees, how to merge them in O(n) time and O(1) >>> > space? >>> > >>> > It can be done using O(n) space as below, >>> > >>> > 1. covert BST #1 into linked list or sorted array >>> > 2. covert BST #2 into linked list or sorted array >>> > 3. merge them... >>> > >>> > but how to do this in place? >>> >>> -- >>> 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]<algogeeks%[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]<algogeeks%[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]<algogeeks%[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.
