Define Largest: Total no of nodes in sub-tree or Height of sub-tree On Sun, Jul 10, 2011 at 8:50 PM, Decipher <[email protected]> wrote:
> Write a code in C/C++ to find the largest BST sub-tree in a binary tree . > Eg:- > 10 > / \ > 5 15 > / \ / \ > 1 8 14 17 > / \ > 16 19 > Then answer should be - > > 15 > 14 17 > 16 19 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/COM2hRO-VZgJ. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
