Register

total possible BST with n nodes

406 views
0 votes
0 votes
total possible binary search trees with 3 nodes is:

14      15    6     none
User Avatar

1 Answer

2 votes
2 votes
5

2nCn/n+1

=6C3/4
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Nachiket Karambelkar asked Jun 21, 2016
1,499 views
gate-1990-->Total external path length of binary tree with n external nodes ?
options are - 1) <=n^2 always 2) >=nlogn always 3) n^2 4)O(n) for some special trees
options are - 1) <=n^2 always 2) >=nlogn always 3) n^2 4)O(n) for some special trees
User Avatar
0 votes
0 votes
0 answers
2
iarnav asked Apr 19, 2018
419 views
#Algorithms How many cuts are possible are in a graph with n nodes?
Some say answer is 2n and someplace else it's been told 2n-1-1. So, what's the corrent one?
Some say answer is 2n and someplace else it's been told 2n-1-1. So, what's the corrent one?
User Avatar
1 votes
1 votes
1 answer
3
Himani Srivastava asked Oct 16, 2015
7,899 views
The number of possible ordered trees with 3 nodes A,B,C
amount of time it would take to send 500 packets using 6-packet size window and without sliding window will be, when the time to send in one direction is 5 ms 31000, 5000 4600, 21600 5000, 30000 30000, 5000.......... pls explain the logic behind?
amount of time it would take to send 500 packets using 6-packet size window and without sliding window will be, when the time to send in one direction is 5 ms31000, 50004...
User Avatar
1 votes
1 votes
1 answer
4
radha gogia asked Jul 24, 2018
1,433 views
What is the total number of distinct words that can be formed out of n letters using below operations with stack ?
Suppose one character at a time comes as an input from a string of letters . There is an option either to 1) print the incoming letter or to 2) put the incoming letter on...
User Avatar
Link Copied!