Plan to throw one (implementation) away; you will, anyhow. Fred Brooks

Find deepest common ancestor in BST

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


Data structure Description

Write a program to find a deepest common ancestor in Binary Search Tree.


Output

   					 

All Binary Tree Values: 4  8  10  12  14  20  22  
Deepest Common Ancestor of 10 and 22: 20

				    

Comments


No comments available!

Please login to add comments.