Remember, It is important to associate new knowledge with those you’ve already learnt.

Chapter 9. Crafting Elegant Code with Stacks and Queues

Stacks and queues are used to handle temporary data.

Stacks follow the rule of LIFO, which stands for “Last In, First Out”. This means the item pushed onto a stack is always the first item poped from it. While a stack is not a built-in data structure in most programming languages, it’s still an abstract data type revolves around some other built-in data structure. A programming language linter is an example of the implementation using stacks, and the ‘undo’ function in a word processor is also a great use case for a stack.