Question

1. Here we study B-tree insertion and deletion.
   1. (10 pts) Consider the B-tree with minimum branching factor of t = 3 which is displayed below:
      Here we study B-tree insertion and deletion (a) (10 pts) Consider the B-tree with minimum branching factor of t-3 which is displayed below DGKNYV AC EF HI LM OPRST WX Show the B-tree that results when J and then Q are inserted. You are expected to give (and clearly label) the B-tree obtained after inserting J, and then the B-tree obtained after inserting Q (b) (10 pts) Consider the B-tree with minimum branching factor of 2 which is displayed below GL BD Y, A CF IK M o Q ST X Z Show the B-tree that results when deleting Y. Please re-draw the relevant portions of the B-tree when any major changes occur. For the final B-tree please show the entire tree
      

Answer 1

insotJ insert l K. I RITx Final tee alter insOn3

b).Deletion in B-tree algorithm:-

1).First find the node to be deleted.

2).i).If that node is lead then delete it,see if minimum key constraints is satisfied or not.

IF It is satisfied then ok.If not then underflow occurs,then see if its immediate right or left sibling can help him to overcome underflow.

If left can then take a key into node from parent and put the largest in left node as key in parent.

If right can then take a key into node from parent and put the smallest in its right node as key in parent.

If node sibling's can't help then merge the nodes(sibling) into one.by taking key from parent and two child nodes.

3).If that node is not leaf.

Delete it,replace it by predecessor or successor.

See if any problem exists.then solve it using steps in steps in 2).

2- minimun banchin fach carly nvde conkaining 2 is satistying mnimum constainks 4 kame finat tee atter 1시 2. B D