reading-notes

🗒️ Class 10: Stacks and Queues

A stack is a data structure that consists of Nodes. Each Node references the next Node in the stack, but does not reference its previous.

Vocabulary / definition list for Stacks (vertical)

1. Push - Node/Items put into a list
2. Pop - Node/Items removed from the list
3. Peek - Viewingthe value of the Top node
4. isEmpty - returns true if stack is empty
5. FILO - First In Last Out
6. LIFO - Last In Last Out

Vocabulary / definition list for Queue (horizontal)

1. Enqueue - Node/Items added to the queue
2. Dequeue - Node/Items removed to the queue
3. Front - First Node of the queue
4. Rear - Last Node of the queue
5. isEmpty - returns true if stack is empty
6. Peek - Looking at the front node in the queue
7. FILO - First In Last Out
8. LIFO - Last In Last Out