In addition to the counter, \(\mathtt{n}\), that keeps track of the number of elements in the LinearHashTable, a counter, \(\mathtt{q}\), keeps track of the number of elements of Types 1 and 3. To ana...In addition to the counter, \(\mathtt{n}\), that keeps track of the number of elements in the LinearHashTable, a counter, \(\mathtt{q}\), keeps track of the number of elements of Types 1 and 3. To analyze the \(\mathtt{find(x)}\) operation when \(\mathtt{x}\) is contained in the table, we need only note that this is the same as the cost of the \(\mathtt{add(x)}\) operation that previously added \(\mathtt{x}\) to the table.
