hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-28 07:59:42 +08:00
Code Issues Packages Projects Releases Wiki Activity
f1de657bca
javascript-algorithms/src/data-structures/stack
History
Boardens 95641c8aaf
Add french translation for some chapters (#520) 
* Create README.fr-FR.md

* Translate to french "Priority Queue" module

* Add english lang redirection

* Update README.fr-FR.md

* Update README.fr-FR.md

* Add French lang version redir

* Create README.fr-FR.md

* Added french translation for Queue

* Added French lang redir

* Update README.md

* Create README.fr-FR.md

* Add french translation

* Index french translation

* Create README.fr-FR.md

* Add french translation

* Index french translation

* Fix translation

* Create README.fr-FR.md

* Add french translation

* Index french translation

* Add wikipedia french reference

* Add french wikipedia reference
2020-08-09 14:10:15 +02:00
..
__test__ Upgrade dependencies and fix ESLint issues. 2020-07-26 13:06:15 +02:00
README.fr-FR.md Add french translation for some chapters (#520) 2020-08-09 14:10:15 +02:00
README.ja-JP.md Add Japanese translation (#1) (#337) 2019-04-12 08:32:08 +03:00
README.md Add french translation for some chapters (#520) 2020-08-09 14:10:15 +02:00
README.pt-BR.md pt-BR translations fixes. 2019-04-16 18:05:39 +03:00
README.ru-RU.md Translate stack into Russian. (#277) 2018-12-28 16:25:36 +02:00
README.zh-CN.md fix wrong words (#273) 2018-12-28 07:03:39 +02:00
Stack.js Upgrade dependencies and fix ESLint issues. 2020-07-26 13:06:15 +02:00

README.md

Stack

Read this in other languages: 简体中文, Русский, 日本語, Français, Português

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. 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.

Simple representation of a stack runtime with push and pop operations.

Stack

References