we  know    that stack   is a data  structure  where  the
highest  priority will be given to the last  element that is
pushed inside and the priority will decrease respectively to
the next consecutive elements........  so we are going to
implement in singly list  .... so we are going to insert the
node to the left side of a reference node....... operations
performed in stack are : PUSH & POP..... PUSH here means we
are going to insert a element only at  last  ..... and POP
means displaying the node from first........


thank u