title: Lazy deletion on hash tables
body: <p>In my implementation I use lazy deletion with linear or quadratic probing for collision resolution.  For insertions, when I encounter a lazily deleted item, I replace it with the item to be inserted.  What are the disadvantages or incorrectness of doing it this way(for either linear or quadratic or double hash collision resolution)?  Doesn't it save space?</p>