Stack as the name suggests, it stores elements one above another like in the picture. It is also known as LIFO or Last In First Out. A new element gets added on the top of lest element and also when comes for removal, it is also the last added element which gets deleted first. Addition of a new elemnt in the queue is also known as Push and removal of any element is called Pop.
Let us take an example of how we keep our books one above another. We can add a new book on top of the last book. This collection grows from bottom to top or in the reverse order. Also removal of any book is not possible. If we do so it will collapse. Thus the only option remains is getting back the last book which is on the top position.
Let us now visualize a stack with the help of a linked list. We can say that elements will be added at tail as well as will be deleted from the tail or will be added at head and deleted from head.