search
Log In
1 vote
1.6k views

In a $B$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ?

  1. $1$ 
  2. $2$ 
  3. $3$
  4. $4$
in DS
recategorized by
1.6k views

2 Answers

2 votes

Option B

the final tree look like this

0 votes

Ans: B 2

Related questions

1 vote
3 answers
1
678 views
Which of the following expression is represented by the parse tree ? $(A + B) ^{*} C$ $A + ^{*} BC$ $A + B * C$ $A * C + B$
asked Sep 16, 2016 in DS makhdoom ghaya 678 views
0 votes
3 answers
2
813 views
A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ? $100$ $200$ $10000$ There is no upper limit
asked Sep 16, 2016 in DS makhdoom ghaya 813 views
1 vote
1 answer
3
1.3k views
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as ! About $\log_{2} n$ About $2 \log_{2} n$ About $n \log_{2} n$ About $2n$
asked Sep 16, 2016 in DS makhdoom ghaya 1.3k views
0 votes
1 answer
4
760 views
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
asked Sep 16, 2016 in DS makhdoom ghaya 760 views
...