count = number of nodes - number of leaf nodes - 1 (for root node)
On Tue, Jun 22, 2010 at 7:56 AM, MOHIT wrote:
> Srry i mean different sub binary search tree of Given binary Search tree
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks"
yes i mean diffrent sub binary search tree of Given binary tree
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr
Srry i mean different sub binary search tree of Given binary Search tree
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks
If it is to find out the number of different Full binary trees, then its
Catalan number problem:
http://en.wikipedia.org/wiki/Catalan_number
Anurag Sharma
On Sun, Jun 20, 2010 at 3:44 PM, sharad kumar wrote:
> u mean to count the different subtrees?
>
>
> On Sun, Jun 20, 2010 at 2:54 PM, RIDER
u mean to count the different subtrees?
On Sun, Jun 20, 2010 at 2:54 PM, RIDER wrote:
> IF i have given N node binary Search Tree . How to count how many
> Structurally different binary tree are possible in that Tree.
>
> --
> You received this message because you are subscribed to the Google Gr
IF i have given N node binary Search Tree . How to count how many
Structurally different binary tree are possible in that Tree.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
T
