Live briefing
Everything about Stack (abstract data type)
Abstract data type
In computer science, a stack is an abstract data type that serves as a collection of elements with two main operations:Push, which adds an element to the collection, and Pop, which removes the most recently added element. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Stack (abstract data type)A 5-minute orientation
- Pick up a classic book: Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)The most-reprinted book on the subject
- Go sideways: Queue (abstract data type)A closely related topic
- Go sideways: Abstract data typeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Queue (abstract data type) In computer science, a queue is an abstract data type that serves as an ordered collection of entities. By convention, the end of the queue where elements…
- Abstract data type In computer science, an abstract data type (ADT) is a mathematical model for data types, defined by its behavior (semantics) from the point of view of…
- Double-ended queue Input Input Output Output as a queue as a stack In computer science, a double-ended queue (abbreviated as deque — /dɛk/ DEK), is an abstract data type…
- Call stack In computer science, a call stack is a stack data structure that stores information about the active subroutines and inline blocks of a computer program…
- Data structure In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data. More precisely, a data structure…
- ABA problem In multithreaded computing, the ABA problem occurs during synchronization, when a location is read twice, has the same value for both reads, and the read…
- Circular buffer In computer science, a circular buffer, circular queue, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it…
- Tree traversal In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting…