If the child y that precedes k in node x has at least t keys (more than the If key k is in node x and x is an internal node, there are three cases to consider:

key k is in node x and x is a leaf, simply delete k from x. If the key is already in a leaf node, and removing it doesn’t cause that leaf node to have too few keys, then simply remove the key to be deleted. Let k be the key to be deleted, x the node containing the key. There are three possible case for deletion in b tree. For deletion in b tree we wish to remove from a leaf.