The GATE Grind

GATE 2009 CS – Question 44

Databases · File Organization and Indexing (B and B+ Trees) · 2 marks · Multiple choice

An initially empty B+ tree has internal-node order3 (maximum tree pointers per internal node) and leaf order2 (maximum data items per leaf). Insert 10, 3, 6, 8, 4, 2, 1 in this order. What is the maximum number of leaf splits caused by the insertions?

  1. 2
  2. 3
  3. 4
  4. 5

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) 4

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More File Organization and Indexing (B and B+ Trees) questions

All File Organization and Indexing (B and B+ Trees) questions →