Up to a point, it is better to just let the snags [bugs] be there than to spend such time in design that there are none. Alan M. Turing

Merge two BSTs with limited extra space

Language Java | Level Intermediate | Category Data structure | September 6, 2015 8:27 am


Data structure Description

Write a program to merge two Binary search Trees with limited extra space.


Output

   					 

Tree1 values:70  90  110  
Tree2 values:5  60  800  
Balanced Tree after merge two tree values:5  60  70  90  110  800  

				    

Comments


No comments available!

Please login to add comments.