to delete an internal nodepromote the successor or predecessor of the key to be deleted to occupy the position of the deleted key this predecessor or successor will always be in the leaf node so the processing will be done as if value from the leaf node has been deleted example consider the following tree of order and delete values and from it (fig ( ) step delete step delete step delete step delete figure tree example consider the tree of order given below and perform the following operations(ainsert and then (bdelete