Structure of a linked list based stack

Going back to the definition of a stack, it is a linear data structure that only supports push and pop operations to add and remove data items from one end of the stack. Like an array, a linked list is another data structure that is the perfect candidate for implementing a stack. Unlike arrays, which have a fixed size and are used to implement bounded stacks, linked lists can be as big as the computer memory permits, so they can be used to implement an unbounded stack. 

State information