Given n nodes. Find the number of different structural
binary trees that can be formed using the nodes.

Answers were Sorted based on User's Feedback

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

m = 1 2 3 4 5 6 7 8
n=1 1
2 1 1
3 2 2 1
4 5 5 3 1
5 14 14 9 4 1
6 42 42 28 14 5 1
7 132 132 90 48 20 6 1
8 429 429 297 165 75 27 7 1

(2n)!/[(n+1)!n!]

 Is This Answer Correct ? 135 Yes 16 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

There are 2 pointers available for each node.
So we can have 2*n pointers totally.

Total no. of edges = n-1

So, Null pointers = n+1.

We need to choose (n-1) pointers from 2n pointers.

So the combination results in (2n)C(n-1).

We can have n distinct roots possible.

So, answer will be (2n) C (n-1) / n.

{2n C n}/{n+1}. ( Unlabelled )

Labelled Structured tree will be,

{2n C n}/{n+1} * {n!}

 Is This Answer Correct ? 30 Yes 6 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

No. of labeled binary tree :

n^(n-2)

No. unlabeled binary tree :

(2n)!/[(n+1)!.n!] (this is known as catlon number)

 Is This Answer Correct ? 25 Yes 12 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

No. of labeled binary tree :

{(2n)!/[(n+1)!.n!]}*n!

No. unlabeled binary tree :

(2n)!/[(n+1)!.n!] (this is known as catlon number)

 Is This Answer Correct ? 19 Yes 11 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

(2n)!/(n+1)!*n!

 Is This Answer Correct ? 5 Yes 0 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

The number of different trees with 8 nodes is 248
2^n - n

 Is This Answer Correct ? 5 Yes 0 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

int countTrees(int num)
{
if(num<=1)
return 1;
else
{
int root,left,right,sum=0;
for(root=1;root<=num;root++)
{
left=countTrees(root-1);
right=countTrees(num-root);
sum+=left*right;
}
return sum;
}
}

 Is This Answer Correct ? 5 Yes 1 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

(2n)!/[(n+1)!*n!]

 Is This Answer Correct ? 2 Yes 0 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

The max number of binary trees that can be formed from n
nodes is given by the Catlan Number C(n).

C(n) = (2n)! / (n+1)!*n! for n>=0.

int findNoTree(int low ,int high)
{
int sum=0;
if(low<=high)
{
for(int k=low;k<=high;k++)
{
if(k==low)
sum+=findNoTree(low+1,high);
else
{
if(k==high)
sum+=findNoTree(low,high-1);
else

sum=sum+findNoTree(low,k-1)*findNoTree(k+1,high);
}
}

return sum;
}
return 1;
}

 Is This Answer Correct ? 2 Yes 1 No

Given n nodes. Find the number of different structural binary trees that can be formed using the no..

(2n)!/(n+1)!

 Is This Answer Correct ? 0 Yes 2 No

More C Code Interview Questions

Can you send Code for Run Length Encoding Of BMP Image in C Language in linux(i.e Compression and Decompression) ?

main() { int x=5; clrscr(); for(;x<= 0;x--) { printf("x=%d ", x--); } } a. 5, 3, 1 b. 5, 2, 1, c. 5, 3, 1, -1, 3 d. –3, -1, 1, 3, 5

main() { char p[ ]="%d\n"; p = 'c'; printf(p,65); }

void main() { int x,y=2,z; z=(z*=2)+(x=y=z); printf("%d",z); }

main() { int k=1; printf("%d==1 is ""%s",k,k==1?"TRUE":"FALSE"); }

#define f(g,g2) g##g2 main() { int var12=100; printf("%d",f(var,12)); }

int a = 10 + 10 .... ,... A = A * A What would be the value of A? The answer is 120!! Could anyone explain this to me.

main( ) { int a[ ] = {10,20,30,40,50},j,*p; for(j=0; j<5; j++) { printf(“%d” ,*a); a++; } p = a; for(j=0; j<5; j++) { printf(“%d ” ,*p); p++; } }

main() { int i=10,j=20; j = i, j?(i,j)?i:j:j; printf("%d %d",i,j); }

main() { char i=0; for(;i>=0;i++) ; printf("%d\n",i); }

How to swap two variables, without using third variable ?

Design an implement of the inputs functions for event mode

Categories
• C Code (422)
• C++ Code (127)
• VC++ Code (17)
• Java Code (84)
• Dot Net Code (114)
• Visual Basic Code (11)
• Programming Code AllOther (62)