1,931 views
2 votes
2 votes

The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.

2 Answers

0 votes
0 votes

if you fill max then only node is going to split.

5 keys are required to reach level three

5,4,3,2,1 are keys use left baising

Related questions

0 votes
0 votes
3 answers
1
Na462 asked Feb 2, 2019
2,043 views
0 votes
0 votes
1 answer
2
iarnav asked Dec 15, 2017
1,367 views
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
0 votes
0 votes
0 answers
3
iarnav asked Dec 15, 2017
190 views
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.
0 votes
0 votes
0 answers
4
iarnav asked Dec 15, 2017
291 views
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.