|
|
Автор: Jesse Russel
Год: 2012
Издание:
Книга по Требованию
Страниц: 92
ISBN: 9785511104010
High Quality Content by WIKIPEDIA articles! In computer science, a stack is a last in, first out (LIFO) abstract data type and linear data structure. A stack can have any abstract data type as an element, but is characterized by only three fundamental operations: push, pop and stack top. The push operation adds a new item to the top of the stack, or initializes the stack if it is empty. If the stack is full and does not contain enough space to accept the given item, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack. A pop either reveals previously concealed items, or results in an empty stack, but if the stack is empty then it goes into underflow state (It means no items are present in stack to be removed). The stack top operation gets the data from the top-most position and returns it to the user without deleting it. The same underflow state can also occur in stack top operation if stack is empty. Данное издание...
|
|
Jesse RusselStack (abstract data type)
Jesse RusselQueue (abstract data type)
Jesse RussellSet (abstract data type)