•Stacks
example:
-Free to organize the data anyway you want so long as the order in which the items were put into the stack is preserved, so that the last thing added to the list can be retrieved first (LIFO – Last-in-First-Out).
-There are only two operations:
-“Push” which means put something on the top of the stack
-“Pop” which means get (and remove) whatever is on top of the stack
-
-
–