Register

#gatebook_dsa
closed

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

Related questions

2 votes
2 votes
1 answer
1
Anil Khatri asked Aug 27, 2016
665 views
#gatebook_dsa
The number of binary search trees with 2n+1 keys where median is the root? $(\frac{2nc_n}{n+1})^2$ $(n!)^2$ $(2n+1)!$ it depends on the values of the keys
The number of binary search trees with 2n+1 keys where median is the root?$(\frac{2nc_n}{n+1})^2$$(n!)^2$$(2n+1)!$it depends on the values of the keys
User Avatar
Link Copied!