the splitting process involves two steps firsta new node is createdthen the new key is compared to the two keys ( and in the original node the smallest among the three is inserted into the original node and the largest is inserted into the new node the middle value is promoted to the parent along with reference to the newly created node the promoted key and reference are then inserted into the parent node figure illustrates the three possible cases when splitting leaf node and are the two keys in the original node and is the new key that we are trying to insert into the node (ax is the smallest key (bx is the middle key (cx is the largest key figure splitting leaf node into two nodeseach node gets one key and one key is promoted to the parent when key is promoted to the parentit has to be inserted into the parent' node in similar fashion to that of leaf node the difference is that reference to the newly created node is also passed up to the parent that has to be inserted into one of the link fields of the parent inserting the promoted key and reference into the parent node is simple if the parent contains single key the placement of the key and reference depends on which child node was splitas illustrated in figure (asplitting the left child kp kp kl kn km kl kn km (bsplitting the middle child kp kp kl km kn kl km kn figure inserting the promoted key and reference into parent with one key