lesson1Title

lesson2Title

lesson3Title

lesson4Title

lesson5Title

lesson6Title

lesson7Title

lesson8Title

lesson9Title

lesson10Title

lesson11Title

pythonIntroAlgorithms2Chapter2Title

lesson12Title

lesson13Title

lesson14Title

lesson15Title

lesson16Title

lesson17Title

pythonIntroAlgorithms2Chapter1Title

pythonIntroAlgorithms2Chapter3Title

pythonIntroAlgorithms2Chapter4Title

# Review of Key Data Structures

Let's review the key data structures we've covered in previous lectures. 

## Stack

- A data structure that follows the `Last In First Out (LIFO)` method, where the most recently added data is the first to be removed.

<br />

## Queue

- A data structure that follows the `First In First Out (FIFO)` method, where the earliest added data is the first to be removed.

<br />

## Linked List

- A data structure consisting of Nodes that contain data and are linked together by Pointers.

<br />

## Hash Table

- A data structure that maps `Keys` to `Values` and uses a hash function to determine the storage location of the keys.