Stack data structure

The stack is a data structure which works in the principle of Last In First Out (LIFO). This means that the last item put on the stack is the first item that can be taken off, like with a real stack of plates.

The two main operations applicable to a stack are:

• push: an item is put on top of the stack, increasing the stack size by one. As stack size is usually limited, this may provoke a stack overflow if the maximum size is exceeded.
• pop: the top item is taken from the stack, decreasing stack size by one. In the case where there was no top item (i.e. the stack was empty), a stack underflow occurs.

Some environments that rely heavily on stacks may provide additional operations, for example:

• dup: the top item is popped and pushed again twice, so that an additional copy of the former top item is now on top, with the original below it.
• swap or exchange: the two topmost items are exchanged.
• rotate: the three topmost items exchange places in a rotary fashion. Two variants of this operation are possible, most often called left and right rotate.

Stacks are either visualised growing from the bottom up (like real-world stacks) or growing from left to right, so that "topmost" becomes "rightmost". This means that a right rotate will move the first element to the third position, the second to the first and the third to the second. Here are two equivalent visualisations of this process:

 apple                                     banana
 banana                 ==right rotate==>  cucumber
 cucumber                                  apple

 cucumber banana apple  ==right rotate==>  apple cucumber banana

A stack may be represented in computers inside block of memory cells, with the bottom at a fixed location, and a variable pointer to the current top cell. pushing first increases the top pointer by one, pointing it to the next cell, and then fills that with the new top value. poping first takes the top value, and then decreases the top pointer by one. Increasing and decreasing may be exchanged to yield a stack representation that grows from high addresses to lower ones.

In application programs written in a [high level language]?, a stack can be implemented efficiently using both arrays and linked lists.

===Applications===

Calculators employing [reverse polish notation]? use a stack structure to hold values.

A number of computer languages are stack-oriented, meaning they define most basic operations (adding two numbers, printing a character) as taking their arguments from the stack, and placing any return values back on the stack. These languages include Forth, and Postscript.

Many virtual machines are also stack-oriented: p-code machine, Java virtual machine.

Almost all computer environments use a stack to hold information about procedure/function nesting.