Lazy deletion

From Wikipedia, the free encyclopedia

In computer science, lazy deletion refers to a method of deleting elements from a hash table that uses open addressing. In this method, deletions are done by marking an element as deleted, rather than erasing it entirely. This is done so that elements inserted using open addressing techniques like linear probing do not become unfindable.