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

Find a pair with given sum in a Balanced BST

Language Java | Level Intermediate | Category Data structure | September 8, 2015 7:52 am


Data structure Description

Write a program to find an item from balanced binary search tree.


Output

   					 

All Binary Tree Values: 1  2  3  4  
Search the number 1 from Binary tree: true
Search the number 7 from Binary tree: false

				    

Comments


No comments available!

Please login to add comments.