data structures lecture notes
e their implementation, use cases, and variants. Hash Tables Hash tables provide average O(1) time complexity for insertions, deletions, and lookups. Key concepts: Hash functions. Collision resolution strategies (chaining, open addr