![]() ![]() Bauer of Technical University Munich proposed the idea of a stack called Operationskeller ("operational cellar") in 1955 and filed a patent in 1957. Subroutines and a two-level stack had already been implemented in Konrad Zuse's Z4 in 1945. Stacks entered the computer science literature in 1946, when Alan Turing used the terms "bury" and "unbury" as a means of calling and returning from subroutines. If the stack is full and does not contain enough space to accept another element, the stack is in a state of stack overflow.Ī stack is needed to implement depth-first search. A stack may be implemented to have a bounded capacity. This data structure makes it possible to implement a stack as a singly linked list and as a pointer to the top element. ![]() Ĭonsidered a linear data structure, or more abstractly a sequential collection, a stack has one end which is the only position at which the push and pop operations may occur, the top of the stack, and is fixed at the other end, the bottom. ![]() As with a stack of physical objects, this structure makes it easy to take an item off the top of the stack, but accessing a datum deeper in the stack may require removing multiple other items first. The order in which an element added to or removed from a stack is described as last in, first out, referred to by the acronym LIFO. The name stack is an analogy to a set of physical items stacked one atop another, such as a stack of plates. Pop, which removes the most recently added element.Īdditionally, a peek operation can, without modifying the stack, return the value of the last element added.Push, which adds an element to the collection, and.In computer science, a stack is an abstract data type that serves as a collection of elements with two main operations: Simple representation of a stack runtime with push and pop operations. Similarly to a stack of plates, adding or removing is only possible at the top. For some concrete uses of the term in computing, see Stack (disambiguation) § Computing. This article is about the abstract concept. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |