Back مكدس (بنية بيانات) Arabic Стэк BE-X-OLD Стек (структура от данни) Bulgarian Stek BS Memòria en pila (estructura de dades) Catalan Zásobník (datová struktura) Czech Stak (datastruktur) Danish Stapelspeicher German Στοίβα (δομή δεδομένων) Greek Stack (abstract data type) English
&sq=Albert Einstein&lang=simple&file=File:Question_book-4.svg){kind=small} | This article does not have any sources. (June 2009) |
&sq=Albert Einstein&lang=simple&file=File:Data_stack.svg)
The stack is one of the most important data structures in computer science. To understand how a stack works, think of a deck of playing cards that is face down. We can only easily access the card that is on top. When we want to look at the top card, there are two things we can do: we can peek at it, but leave it on the stack, or we can pop it off. When we pop off the top object, we are taking it off the stack. If we want to add another card to the top of the stack, we push.
A stack is called a last-in-first-out (LIFO) collection. This means that the last thing we added (pushed) is the first thing that gets pulled (popped) off. If the last card we put on our stack of cards was an ace, then the first card we pulled from the top is that same ace.