This post covers the following topics: Stacks Queues Stacks (LIFO) A stack handles linear lists of data, stacks follow Last-In First-Out (LIFO) . This means that the most recent piece of data to be placed onto the stack is the first piece to be taken off of it. Example of Last-In First-Out (Stack) To add data to a stack it's pushing to the stack and to take data off the stack it's popping . Stacks can be implemented easily using an array or linked list and a variable to poin