edited by
15,961 views
46 votes
46 votes

Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.

Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?

  1. $1$
  2. $2$
  3. $3$
  4. $4$
edited by

5 Answers

–3 votes
–3 votes
1 node will be there (15,20)
edited by
Answer:

Related questions

53 votes
53 votes
5 answers
4
Ishrat Jahan asked Oct 30, 2014
17,687 views
Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...