The evolution of languages: FORTRAN is a non-typed language. C is a weakly typed language. Ada is a strongly typed language. C++ is a strongly hyped language. Ron Sercely

Merge two BST

Language Java | Level Intermediate | Category Data structure | September 6, 2015 7:54 am


Data structure Description

Write a program to Merge two binary search trees and return the root node to display the values.


Output

   					 

All Binary Tree Values: 1 2 3 4  
All Binary Tree Values: 11 22 33 44  
All Binary Tree Values: 1 2 3 4 11 22 33 44  

				    

Comments


No comments available!

Please login to add comments.