Deletion: the removal algorithm consists of three steps: Replace the root element with the entry that is in the last node w. Remove w. Restore the head-order property.