Too Long; Didn't Read
Last week, we explored the <strong>binary search tree </strong>data structure and how to implement them in JavaScript. This week we will look at another data structure known as a <strong>hash table, </strong>also known as a <strong>hash map</strong>. Hash tables allow us to look up and insert data in constant time or O(1). In many situations, a hash table turns out to be more efficient than search trees or other table lookup structures. You can find the full repo for my hash table build along with a few other data structures here — <a href="https://github.com/mega0319/data-structures">https://github.com/mega0319/data-structures</a>