nodeand one to move up to the parent node full node in tree has three data itemswhich are moved to these three destinations howevera full node in tree has only two data items where can we get third itemwe must use the new itemthe one being inserted in the tree in tree the new item is inserted after all the splits have taken place in the - tree it must participate in the split it must be inserted in leafso no splits are possible on the way down if the leaf node where the new item should be inserted is not fullthe new item can be inserted immediatelybut if the leaf node is fullit must be split its two items and the new item are distributed among these three nodesthe existing nodethe new nodeand the parent node if the parent is not fullthe operation is complete (after connecting the new nodethis situation is shown in figure ab figure insertion with non-full parent howeverif the parent is fullit too must be split its two items and the item passed up from its recently split child must be distributed among the parenta new sibling of the parentand the parent' parent this situation is shown in figure ab figure insertion with full parent if the parent' parent (the grandparent of the leaf nodeis fullit too must be split the splitting process ripples upward until either non-full parent or the root is encountered if the root is fulla new root is created that is the parent of the old rootas shown in figure