because by computing the hash function on elements,we put the elements into the specific row correspond to the index computed by hash function. therefore by computing that hash func again we can access the same element i.e.computing hash func take O(1) arithmetic computation hence take O(1) time i.e. constant time