--- In [email protected], Rajesh sekhawat <[EMAIL PROTECTED]> wrote: > > Hi All > Can anyone write one programme in C language to merge the > contents of two binary search tree into one. you also need > to calculate the time and space complexities of programme ?.
Of course many people on this board will be able to. Does that answer your question? ;-) Sorry, couldn't help it. (O.k., I did not WANT to help it.) It depends: 1) Do you need tree #1 unaltered after the merge? 2) Do you need tree #2 unaltered after the merge? 3) Does it have to be a "pure merge" (i.e. the contents of one tree are added to another tree), or does your homework question also allow for a newly built tree which is set up node by node? Regards, Nico
