OR
10
/ \
5 15
/ \ / \
1 8 14 17
/ \
16 19
:-)
Thanks,
- Ravindra
On Thu, Jul 14, 2011 at 12:04 AM, vikas <vikas.rastogi2...@gmail.com> wrote:
> correction : ans should be :)
>
> 10
> \
> 15
> / \
> 14 17
> / \
> 16 19
>
>
> On Jul 10, 8:20 pm, Decipher <ankurseth...@gmail.com> 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 post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
