Hash tables are used to store key-value pairs. A structure that can map keys and values.
It’s great to use because it is fast to map, add, and delete value.

A key and value will be paired together to have a specific location. When finding a key the value will be returned. For example in banks they account number which is the key and the value is the information inside the accounts that is stored. It is easier to find and store.
Hash-tables in different languages
- JavaScript- Object and Maps.
2. Java, Go, and Scala- Maps.
3. Ruby- Hashes.
4. Python- Dictionaries.
Using this are one of the most common actions we do in Computer Science.
Similar to binary search trees but with different set of rules.
There are two different Binary heaps
- Max Binary Heap which has the largest value on the root node and parent node should always be larger than child node.

2. Min Binary Heap which is the opposite of the max. The root node is the Lowest value and the parent node is always larger than the child node.