A stack is a data structure that consists of Nodes

Common terminology for a stack is

Push - Nodes or items that are put into the stack are pushed Pop- Nodes or items that are removed from the stack are popped Top- This is the top of the stack. Peek - When you peek you will view the top Node in the stack. If the stack is empty, and you don’t peek, you will receive a NullReferenceException if you attempt to pop. Stacks follow these concepts:

FILO First In Last Out This means that the first item added in the stack will be the last item popped out of the stack. LIFO Last In First Out This means that the last item added to the stack will be the first item popped out of the stack.