If I want to implement a hash table, and two elements collide, I understand that I can either rehash via open addressing or chain at the index via a linked list.
How does the same idea apply for a set() data structure? Is the linkedlist at the collision index being traversed to see if the key already exists before insertion which implies O(N) time complexity?
