The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+6 votes

We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to 3 for the following set of key values:

80, 50, 10, 70, 30, 100, 90

Assume that the tree is initially empty and the values are added in the order given.

  1. Show the tree after insertion of 10, after insertion of 30, and after insertion of 90. Intermediate trees need not be shown.
  2. The key values 30 and 10 are now deleted from the tree in that order show the tree after each deletion.
asked in Databases by Veteran (59.6k points)
edited by | 609 views
fanout means no of records per node but b+ trees contain an additional pointer pointing to next node so in this case would splitting will take place after insertion of 2 key values or 3 key values? Plz explain...
After 2 key values. Also, that additional pointer appears only in leaves.
why split after 2 key value ??

since order = 3, so we can have 2 key elements in a node with no problem but when we have 3 key then it should be a overflow right ??
plz explain this one....
Same like btree

1 Answer

0 votes
Please explain this
answered by (69 points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,871 questions
47,531 answers
62,297 users