In computer science, lazy deletion refers to a method of deleting elements from a hash table that uses open addressing.
Deleted locations are treated as empty when inserting and as occupied during a search.
The deleted locations are sometimes referred to as tombstones.
To improve this, when an element is searched and found in the table, the element is relocated to the first location marked for deletion that was probed during the search.
This algorithms or data structures-related article is a stub.