[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]

    Search the Q&A Archives

1) Write a program in 'c' language to merge the contents of...

<< Back to: Binary Space Partitioning Trees FAQ

Question by TSR.Subramanian
Submitted on 4/12/2004
Related FAQ: Binary Space Partitioning Trees FAQ
Rating: Not yet rated Rate this question: Vote
1) Write a program in 'c' language to merge the contents of two binary search trees into one.What is the time and storage complexities of your program?

2)Write a program in 'c' language to count the number of internal nodes of a tree.



Answer by alok
Submitted on 10/10/2006
Rating: Not yet rated Rate this answer: Vote
xcbcbvcvb

 

Answer by anshul
Submitted on 4/15/2007
Rating: Not yet rated Rate this answer: Vote
can anyone tell me the program to merge the search of two binary trees into one.n calculate the time n space complexities.

 

Your answer will be published for anyone to see and rate.  Your answer will not be displayed immediately.  If you'd like to get expert points and benefit from positive ratings, please create a new account or login into an existing account below.


Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer:

FAQS.ORG reserves the right to edit your answer as to improve its clarity.  By submitting your answer you authorize FAQS.ORG to publish your answer on the WWW without any restrictions. You agree to hold harmless and indemnify FAQS.ORG against any claims, costs, or damages resulting from publishing your answer.

 

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

 

<< Back to: Binary Space Partitioning Trees FAQ

[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]
© 2008 FAQS.ORG. All rights reserved.