Stacks: Inserting & Deleting
Pushing an element on a stack is similar to adding an element to the front of a linked list.
A stack can be accessed through the top element and a linked list representation can be accessed through the pointer to the first element in the list. This element represents the last element inserted into the stack and hence the top of the stack.
Removing the first element of the list is analogous to popping the stack.