Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


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..

Answer / biplab sinha

2nChoosen/(n+1)

Is This Answer Correct ?    3 Yes 20 No

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

Answer / a.s.

it's &#937;((4^n)/(n^(3/2)))

Is This Answer Correct ?    1 Yes 20 No

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

Answer / ss

it is 2^n-n trees.

Is This Answer Correct ?    26 Yes 54 No

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

Answer / maverick

answer: 2^n-2

Is This Answer Correct ?    3 Yes 47 No

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

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

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

Answer / rk

2^n-1

Is This Answer Correct ?    34 Yes 91 No

Post New Answer

More C Code Interview Questions

main() { if (!(1&&0)) { printf("OK I am done."); } else { printf("OK I am gone."); } } a. OK I am done b. OK I am gone c. compile error d. none of the above

3 Answers   HCL,


Write out a function that prints out all the permutations of a string. For example, abc would give you abc, acb, bac, bca, cab, cba. You can assume that all the characters will be unique.

5 Answers   IITR, Microsoft, Nike,


#define DIM( array, type) sizeof(array)/sizeof(type) main() { int arr[10]; printf(“The dimension of the array is %d”, DIM(arr, int)); }

1 Answers  


Is the following statement a declaration/definition. Find what does it mean? int (*x)[10];

1 Answers  


main() { int a=2,*f1,*f2; f1=f2=&a; *f2+=*f2+=a+=2.5; printf("\n%d %d %d",a,*f1,*f2); }

6 Answers  


void main() { int i; char a[]="\0"; if(printf("%s\n",a)) printf("Ok here \n"); else printf("Forget it\n"); }

3 Answers   Accenture,


Write a routine to implement the polymarker function

0 Answers   TCS,


main() { struct date; struct student { char name[30]; struct date dob; }stud; struct date { int day,month,year; }; scanf("%s%d%d%d", stud.rollno, &student.dob.day, &student.dob.month, &student.dob.year); }

1 Answers  


#include<stdio.h> main() { struct xx { int x=3; char name[]="hello"; }; struct xx *s=malloc(sizeof(struct xx)); printf("%d",s->x); printf("%s",s->name); }

1 Answers   TCS,


You are given any character string. Find the number of sets of vowels that come in the order of aeiou in the given string. For eg., let the given string be DIPLOMATIC. The answer returned must be "The number of sets is 2" and "The sets are "IO and AI". Vowels that form a singleton set must be neglected. Try to post the program executable in gcc or g++ or in java.

3 Answers  


void main() { int i=i++,j=j++,k=k++; printf(“%d%d%d”,i,j,k); }

1 Answers  


&#8206;#define good bad main() { int good=1; int bad=0; printf ("good is:%d",good); }

2 Answers  


Categories