Programs must be written for people to read, and only incidentally for machines to execute. Abelson / Sussman

Two nodes of a BST are swapped

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


Data structure Description

Write a program to swap two nodes of a Binary Search trees.


Output

   					 

All Binary Tree Values: 20  30  10  15  5   
All Binary Tree Values After swap: 20  30  10  15  5

				    

Comments


No comments available!

Please login to add comments.