method can be the full leaf node and the new item it will be the responsibility of split(to make the split and insert the new node in the new leaf if split(finds that the leaf' parent is fullit calls itself recursively to split the parent it keeps calling itself until non-full leaf or the root is found the return value of split(is the new right nodewhich can be used by the previous incarnation of split(coding the splitting process is complicated by several factors in tree the three items to be distributed are already sortedbut in the - tree the new item' key must be compared with the two items in the leafthe three are then distributed according to the results of the comparison alsosplitting parent creates second parentso now we have left (the originalparent and new right parent we need to change the connections from single parent with three children to two parents with two children each there are three casesdepending on which child ( or is being split this situation is shown in figure asplitting child child child child child new bsplitting child child child child child child child csplitting child new child child child child figure child connecting the children child child child new