notice that the effect of the node split is to move data up and to the right it' this rearrangement that keeps the tree balanced here the insertion required only one node splitbut more than one full node may be encountered on the path to the insertion point when this is the case there will be multiple splits splitting the root when full root is encountered at the beginning of the search for the insertion pointthe resulting split is slightly more complicateda new node is created that becomes the new root and the parent of the node being split second new node is created that becomes sibling of the node being split data item is moved into the new sibling data item is moved into the new root data item remains where it is the two rightmost children of the node being split are disconnected from it and connected to the new right-hand node figure shows the root being split this process creates new root that' at higher level than the old one thus the overall height of the tree is increased by one