Register

ace mock test

• recategorized by
362 views

1 Answer

0 votes
0 votes
For n Nodes ; For making Binary Search Tree. We should follow a property of BST i.e. its InOrder Traversal should be always in Sorted Order.

If we are having n keys ( being distinct ) then we can have only one Sorted Order.

To achieve this Sorted Order we can arranged node in (2n C n/ (n+1) ) ways to get the Binary Trees with Labelled Nodes.

So, we have ( 2n C n / ( n+1 ) ) BST .
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
talha hashim asked Aug 17, 2018
501 views
ace test series
Consider the problem of construction of minimum cost binary search tree for a given set of 'n' identifiers with their respective probabilities.The time complexity of the most efficient algorithm of the same is___ A)0(n^2) B)0(n^3) C)0(nlogn) D)0((n^3)logn)
Consider the problem of construction of minimum cost binary search tree for a given set of 'n' identifiers with their respective probabilities.The time complexity of the ...
User Avatar
1 votes
1 votes
1 answer
2
talha hashim asked Aug 17, 2018
621 views
ace test series
Consider the following instance of OBST (Optimal Binary Search Tree) Problem. n=4;<a1,a2,a3,a4>=<do,if,int,while> P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1> The Cost of OBST(optimal binary search tree) is________
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBS...
User Avatar
0 votes
0 votes
1 answer
3
ashish pal asked Dec 21, 2017
590 views
Ace Test Series: Programming & DS - Binary Search Tree
User Avatar
Link Copied!