@@ -8,24 +8,26 @@ _Read this in other languages:_
88[ _ Português_ ] ( README.pt-BR.md ) ,
99[ _ 한국어_ ] ( README.ko-KR.md )
1010
11- In computer science, a ** stack** is an abstract data type that serves
11+ In computer science, a ** stack** is an abstract data type that serves
1212as a collection of elements, with two principal operations:
1313
1414* ** push** , which adds an element to the collection, and
1515* ** pop** , which removes the most recently added element that was not yet removed.
1616
17- The order in which elements come off a stack gives rise to its
18- alternative name, LIFO (last in, first out). Additionally, a
19- peek operation may give access to the top without modifying
20- the stack. The name "stack" for this type of structure comes
21- from the analogy to a set of physical items stacked on top of
22- each other, which makes it easy to take an item off the top
23- of the stack, while getting to an item deeper in the stack
17+ The order in which elements come off a stack gives rise to its
18+ alternative name, LIFO (last in, first out). Additionally, a
19+ peek operation may give access to the top without modifying
20+ the stack. The name "stack" for this type of structure comes
21+ from the analogy to a set of physical items stacked on top of
22+ each other, which makes it easy to take an item off the top
23+ of the stack, while getting to an item deeper in the stack
2424may require taking off multiple other items first.
2525
2626Simple representation of a stack runtime with push and pop operations.
2727
28- ![ Stack] ( https://upload.wikimedia.org/wikipedia/commons/b/b4/Lifo_stack.png )
28+ ![ Stack] ( ./images/stack.jpeg )
29+ 30+ * Made with [ okso.app] ( https://okso.app ) *
2931
3032## References
3133
0 commit comments