Now we want to insert an element k. Apply h (k). If it results “x” and the index “x” already contain a value then we again apply hash function that h (k, 1) this equals to (h (k) + 1) mod n. Example: Let hash table of size 5 which has function is mod 5 has already filled at positions 0, 2, 3.
For More Information Please Refer: