If McDonalds were run like a software company, one out of every hundred Big Macs would give you food poisoning, and the response would be, ‘We’re sorry, here’s a coupon for two more.’ “ Mark Minasi

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.