
470 Data Structures Using C
Since the set is an unordered collection of elements, linked list is the most suitable representation
for the sets because elements can be dynamically added or deleted from a set.
10.2.1.2 Hash Table Representation Hash table representation of a set is also a version of linked
representation. A hash table consists of storage locations called buckets. The size of a bucket is arbitrary,
i.e., it can hold any number of elements as it stores them into a linked list.
Consider the following set:
Tokens 5 {126, 235, 100, 317, 68, 129, 39, 423, 561, 222, 986}
Let us store the above set in a hash table of five buckets with hash ...