The best thing about a boolean is even if you are wrong, you are only off by a bit. Anonymous

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.



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



No comments available!

Please login to add comments.