Register

ans please
closed

• closed by
561 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2011 | Question: 29

 We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?
A) 0
B) 1
C) n!
D) (1/(n+1)).2nCn

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Singhravin11 asked Apr 15, 2016
1,539 views
K sorted list,n/k elements what is time complexity?please specifiy ur ans in detail
K sorted lists of n/k elements each. What is time complexity to sort them?please specifiy ur ans in detail
K sorted lists of n/k elements each. What is time complexity to sort them?please specifiy ur ans in detail
User Avatar
2 votes
2 votes
0 answers
2
Jay Singh asked Dec 7, 2015
257 views
bijection, surjection please confirm the ans
User Avatar
0 votes
0 votes
0 answers
3
Mak Indus asked Oct 26, 2018
1,495 views
How we get ans as c.
What is the number of additions in the fibonacci series of n which uses following recursive function. fib (n) = fib (n – 1) + fib (n – 2) (a) f (n – 1) + f (n – 2) (b) f (n – 1) + f (n – 2) + n (c) f (n – 1) + f (n – 2) + 1 (d) f (n – 1) + f (n – 2) + 2n Solution: Option (c)
What is the number of additions in the fibonacci series of n which uses following recursive function. fib (n) = fib (n – 1) + fib (n ...
User Avatar
Link Copied!