There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies, and the other way is to make it so complicated that there are no obvious deficiencies. The first method is far more difficult. C.A.R. Hoare

Find Largest BST in a Tree

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


Data structure Description

Write a program to find the largest item in given binary search tree.


Output

   					 

Items in the Tree: 1 2 4 8 9 5 10 11 3 6 12 13 7 14 15 
Largest Item in BST: 8 

Items in the Tree: null
Largest Item in BST: null

				    

Comments


No comments available!

Please login to add comments.