3.6.4 Result 4: Deletion

• Expected # of probes in a deletion
  $$\leq$$ $${\frac{1}{\alpha}}$$ ln$${\frac{1}{1 -\alpha}}$$ + $${\frac{1}{\alpha}}$$

  Proof is obvious since deletion always follows a successful search.
  

    

  Figure 3.3: Performance of closed hashing

  
  
  

Figure 3.3 depicts the performance of closed hashing for all the four operations discussed above.