Register

binary search tree

778 views
0 votes
0 votes
Consider an empty binary search tree of height -1. We need to feel the following sequence of numbers in it: 11, 12, 13, 14, 15, 16, 17. The number of ways in which the numbers can be inserted in an empty binary search tree, such that the resulting tree has height 6, is _____________
User Avatar

1 Answer

1 votes
1 votes

with n nodes and n-1 height we can construct 2^n-1 binary search tree . 

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
rupamsardar asked Sep 17, 2023
310 views
Binary Search Tree
when searching for the key 60 in a binary search tree containing nodes: 10,20,40,50,70,80,90 are traversed, not nessesarily in this same order. How many different orders are possible in which these keys can occur on the search path from the root node to the node containing key:60 ??
when searching for the key 60 in a binary search tree containing nodes: 10,20,40,50,70,80,90 are traversed, not nessesarily in this same order.How many different orders a...
User Avatar
0 votes
0 votes
0 answers
2
altamash asked Nov 26, 2018
337 views
binary search tree
Consider an empty binary search tree of height -1. We need to feel following sequence of numbers in it: 11, 12, 13, 14, 15, 16, 17. The number of ways in which the numbers can be inserted in an empty binary search tree, such that the resulting tree has height 6, is _____________
Consider an empty binary search tree of height -1. We need to feel following sequence of numbers in it: 11, 12, 13, 14, 15, 16, 17. The number of ways in which the number...
User Avatar
1 votes
1 votes
1 answer
3
pradeepchaudhary asked Aug 19, 2018
19,137 views
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)
User Avatar
2 votes
2 votes
0 answers
4
Parshu gate asked Jan 20, 2018
327 views
binary search tree
User Avatar
Link Copied!