Register

Recent questions tagged binary-search-tree

168 votes
17 answers
214
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________.No...
User Avatar
0 votes
2 answers
218
Ace Test Series: Programming & DS - Binary Search Trees
I am stuck after JAN. It is not getting balanced even after 2 rotations. Can somebody help?
I am stuck after JAN. It is not getting balanced even after 2 rotations. Can somebody help?
User Avatar
1 votes
1 answer
222
BST
certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons when we randomly request one of the records?
certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons w...
User Avatar
1 votes
1 answer
223
No of BST ?
User Avatar
10 votes
3 answers
225
ISRO2011-11
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $35$
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$35$
User Avatar
0 votes
1 answer
226
Optimal binary search tree
Given the following table of data what are the minimum expected no.of comparisons required for an Optimal i 0 1 2 3 4 Pi 3/16 3/16 1/16 1/16 Qi 2/16 3/16 1/16 1/16 1/16 BST that can be constructed with the given data
Given the following table of data what are the minimum expected no.of comparisons required for an Optimali01234Pi 3/163/161/161/16Qi2/163/161/161/161/16BST that can be co...
User Avatar
25 votes
8 answers
227
GATE CSE 2015 Set 3 | Question: 13
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is $65$ $67$ $69$ $83$
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is$65$$67$$69$$83$
User Avatar
2 votes
1 answer
230
Answer the following question
In 28 my answer is c but answer given is d.
In 28 my answer is c but answer given is d.
User Avatar
53 votes
7 answers
232
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number...
User Avatar
32 votes
2 answers
235
GATE IT 2008 | Question: 73
How many distinct BSTs can be constructed with $3$ distinct keys? $4$ $5$ $6$ $9$
How many distinct BSTs can be constructed with $3$ distinct keys?$4$$5$$6$$9$
User Avatar
54 votes
7 answers
239
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
A binary search tree is used to locate the number $43$. Which of the following probe sequences are possible and which are not? Explain.$\begin{array}{llllll} \text{(a)} ...
User Avatar
27 votes
5 answers
240
GATE CSE 1996 | Question: 2.14
A binary search tree is generated by inserting in order the following integers: $50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$ The number of nodes in the left subtree and right subtree of the root respectively is $(4, 7)$ $(7, 4)$ $(8, 3)$ $(3, 8)$
A binary search tree is generated by inserting in order the following integers:$$50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$$The number of nodes in the left subtree and ...
User Avatar
Page: