till nowwe have easily inserted and in the tree because the leaf nodes were not full but nowthe node in which should be inserted is already full as it contains four values here we split the nodes to form two separate nodes but before splittingarrange the key values in order (including the new valuethe ordered set of values is given as and the median value is so push into its parent' node and split the leaf nodes step insert figure (bnow the node in which should be inserted is already full as it contains four key values here we split the nodes to form two separate nodes but before splittingwe arrange the key values in order (including the new valuethe ordered set of values is given as and the median value is so we push into its parent' node and split the leaf nodes but againwe see that the parent' node is already fullso we split the parent node using the same procedure step insert figure (cb tree deleting an element from tree like insertiondeletion is also done from the leaf nodes there are two cases of deletion in the first casea leaf node has to be deleted in the second casean internal node has to be deleted let us first see the steps involved in deleting leaf node locate the leaf node which has to be deleted if the leaf node contains more than the minimum number of key values (more than / elements)then delete the value else if the leaf node does not contain / elementsthen fill the node by taking an element either from the left or from the right sibling (aif the left sibling has more than the minimum number of key valuespush its largest key into its parent' node and pull down the intervening element from the parent node to the leaf node where the key is deleted (belseif the right sibling has more than the minimum number of key valuespush its smallest key into its parent node and pull down the intervening element from the parent node to the leaf node where the key is deleted elseif both left and right siblings contain only the minimum number of elementsthen create new leaf node by combining the two leaf nodes and the intervening element of the parent node (ensuring that the number of elements does not exceed the maximum number of elements node can havethat ismif pulling the intervening element from the parent node leaves it with less than the minimum number of keys in the nodethen propagate the process upwardsthereby reducing the height of the tree