stack algorithms

Stack

First in last out Its similar to the quoe Signly Linked List that u only add or remove from the head - Adding - In order to add we have to update the head pointer to the nex value and then change the head itself - Removing - First save up the head and update the reference StackAddingRemoving_visual.png

[!quote] queue_algorithms