4. Consider the following B+-tree with an order of 1. 1* 3* 9 15 30 9*12*...

 

Transcribed Image Text:

4. Consider the following B+-tree with an order of 1. 1* 3* 9 15 30 9*12* 16* 20* 60 35* 40*60*65* Answer the following questions: a. Insert search key values 32, 21 and 75. Show how the tree expands. (You should redraw the tree if overflow occurs, otherwise simply change the values in appropriate nodes.) b. Delete search key values 65, 60, 35, 20 and 16 (from the original tree) in that order. Show how the tree shrinks. (You should redraw the tree if underflow occurs, otherwise simply change the values in appropriate nodes.) 4. Consider the following B+-tree with an order of 1. 1* 3* 9 15 30 9*12* 16* 20* 60 35* 40*60*65* Answer the following questions: a. Insert search key values 32, 21 and 75. Show how the tree expands. (You should redraw the tree if overflow occurs, otherwise simply change the values in appropriate nodes.) b. Delete search key values 65, 60, 35, 20 and 16 (from the original tree) in that order. Show how the tree shrinks. (You should redraw the tree if underflow occurs, otherwise simply change the values in appropriate nodes.)

Answer rating: 100% (QA)

It looks like youve given me a problem involving a B tree and presented instructions to insert and delete certain keys from the tree Without being able to illustrate directly here Ill guide you throug... View the full answer