step insert in the leaf node the tree after insertion can be given as follows figure (gthe leaf node has three data values thereforethe node is violating the properties of the tree and must be split figure (hthe parent node has three data values thereforethe node is violating the properties of the tree and must be split figure (iinserting values in the given - tree deleting an element from - tree in the deletion processa specified data value is deleted from the - tree if deleting value from node violates the property of treethat isif node is left with less than one data value then two nodes must be merged together to preserve the general properties of - tree in insertionthe new value had to be added in any of the leaf nodes but in deletion it is not necessary that the value has to be deleted from leaf node the value can be deleted from any of the nodes to delete value xit is replaced by its in-order successor and then removed if node becomes empty after deleting valueit is then merged with another node to restore the property of the tree example consider the - tree given below and delete the following values from it figure (ato delete swap it with its in-order successorthat is now comes in the leaf node remove the value from the leaf node