Stack (abstract data type)

  • similar to a stack of plates, adding or removing is only possible at the top.
    simple representation of a stack runtime with push and pop operations.

    in computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations:

    • push, which adds an element to the collection, and
    • pop, which removes the most recently added element that was not yet removed.

    the order in which elements come off a stack gives rise to its alternative name, lifo (last in, first out). additionally, a peek operation may give access to the top without modifying the stack.[1] the name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first.[2]

    considered as a linear data structure, or more abstractly a sequential collection, the push and pop operations occur only at one end of the structure, referred to as the top of the stack. this makes it possible to implement a stack as a singly linked list and a pointer to the top element. a stack may be implemented to have a bounded capacity. if the stack is full and does not contain enough space to accept an entity to be pushed, the stack is then considered to be in an overflow state. the pop operation removes an item from the top of the stack.

    a stack is needed to implement depth-first search.

  • history
  • non-essential operations
  • software stacks
  • hardware stack
  • applications of stacks
  • security
  • see also
  • references
  • further reading
  • external links

Similar to a stack of plates, adding or removing is only possible at the top.
Simple representation of a stack runtime with push and pop operations.

In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations:

  • push, which adds an element to the collection, and
  • pop, which removes the most recently added element that was not yet removed.

The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out). Additionally, a peek operation may give access to the top without modifying the stack.[1] The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first.[2]

Considered as a linear data structure, or more abstractly a sequential collection, the push and pop operations occur only at one end of the structure, referred to as the top of the stack. This makes it possible to implement a stack as a singly linked list and a pointer to the top element. A stack may be implemented to have a bounded capacity. If the stack is full and does not contain enough space to accept an entity to be pushed, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack.

A stack is needed to implement depth-first search.