insert insert insert deletion algorithm descend to the leaf where the key exists remove the required key and associated reference from the node if the node still has enough keys and references to satisfy the invariantsstop