The
implementation of stack using linked list is also possible. The linked list
implementation of stack provides the support to add unlimited data and no
memory wastage is there because linked list creates the new node when new data
is arrived to push and on the request of pop the node is deleted from memory. Therefore,
don’t need the function isempty() and isfull() function like array implementation of stack. Let see an example to
understand the concept of stack implementation on the linked list: