algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-09 03:59:38 +08:00
Code Issues Packages Projects Releases Wiki Activity

Improve readme for stack (#2385)

Browse Source
This commit is contained in:
Raunak Narayan
2021-10-08 21:47:58 +05:30
committed by GitHub
parent e85127ed5b
commit f6f12c0d81
1 changed files with 14 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
DataStructures/Stacks/README.md
View File

@ -4,17 +4,27 @@ stack is an ADT (abstract data type ) that act like list of objects but there is
stack act is _LIFO_ (Last In First Out), it means that when we want to get an element from the stack we get the last element in the stack. stack act is _LIFO_ (Last In First Out), it means that when we want to get an element from the stack we get the last element in the stack.
stack is bast on two methods ( functions) stack is based on two methods (functions)
## push & pop ## push(element)
**push**: add an alement to last index of stack. add "element" to the top of the stack.
for example: we have `1, 3, 5` in stack, then we call push(9), for example: we have `1, 3, 5` in stack, then we call push(9),
`9` will add to last index of stack -> `1, 3, 5 , 9` `9` will add to last index of stack -> `1, 3, 5 , 9`
**pop**: remove the last element from stack. ## peek() or top()
return element at the top of the stack.
for example: we have `1, 3, 5` in stack, then we call peek(),
`5` will be returned (without removing it from the stack)
## pop()
remove the last element (i.e. top of stack) from stack.
for example: we have `1, 3, 5 , 9` in stack, then we call pop(), for example: we have `1, 3, 5 , 9` in stack, then we call pop(),
the function will return `9` and the stack will change to `1, 3, 5`. the function will return `9` and the stack will change to `1, 3, 5`.