Register

#BINARY SEARCH TREE

245 views

1 Answer

Best answer
2 votes
2 votes

Number of elements on the left sub tree is n=4,

so total number of BST(on Left Sub tree) having 4 element

using $\binom{2n}{n}$/(n+1)

 is 14.

similarly number of BST(on Right Sub tree) having 3 element is 5

so total number of BST having 5 as the root is 14*5 =70

• selected 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
Abhijeet_Kumar asked Oct 17, 2017
237 views
#binary tree
User Avatar
0 votes
0 votes
1 answer
2
krish asked Aug 21, 2016
420 views
#binary tree
what is te diffrence b/w hight, depth, level in binary tree and can i say level= height+1 if yes then prove it
what is te diffrence b/w hight, depth, level in binary tree and can i say level= height+1 if yes then prove it
User Avatar
0 votes
0 votes
1 answer
3
iarnav asked Jun 19, 2018
710 views
#Binary Max Heap Question (Doubt)
Let's say we're given with a MAX Heap and we want to delete any of the leaf node, then how much time will it take to delete any of the leaf node and maintain the max heap property? My main doubt is - will it O(n) time to reach to leaf nodes?
Let's say we're given with a MAX Heap and we want to delete any of the leaf node, then how much time will it take to delete any of the leaf node and maintain the max heap...
User Avatar
0 votes
0 votes
1 answer
4
someshawasthi asked Feb 27, 2023
465 views
binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing value 4?
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many differen...
User Avatar
Link Copied!