Skip to main content

Hash Table

Data Structures

A structure mapping keys to values with average O(1) lookup.

A hash table (or hash map) stores key-value pairs and uses a hash function to compute an index into an array of buckets, giving average constant-time insertion and lookup. Collisions are handled with techniques such as chaining or open addressing.

Related Data Structures terms

Stack

A last-in, first-out (LIFO) collection.

 Array

An ordered collection of elements stored at contiguous indices.
← Back to full glossary