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
Answer / v.suresh kumar
It is possible to form 2^n - 1 binary trees with n nodes.
| Is This Answer Correct ? | 21 Yes | 69 No |
void main() { char far *farther,*farthest; printf("%d..%d",sizeof(farther),sizeof(farthest)); }
main() { int i=4,j=7; j = j || i++ && printf("YOU CAN"); printf("%d %d", i, j); }
main() { int c = 5; printf("%d", main||c); } a. 1 b. 5 c. 0 d. none of the above
{ int *ptr=(int*)malloc(sizeof(int)); *ptr=4; printf("%d",(*ptr)+++*ptr++); }
Write a program to receive an integer and find it's octal equivalent. How can i do with using while loop.
main() { int i=3; switch(i) { default:printf("zero"); case 1: printf("one"); break; case 2:printf("two"); break; case 3: printf("three"); break; } }
main() { printf("%d", out); } int out=100;
Printf can be implemented by using __________ list.
what will be the output of this program? void main() { int a[]={5,10,15}; int i=0,num; num=a[++i] + ++i +(++i); printf("%d",num); }
main() { static int var = 5; printf("%d ",var--); if(var) main(); }
Is the following code legal? struct a { int x; struct a *b; }
What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?