mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-19 17:54:42 +08:00
Resolve build errors & cleanup structure (#2334)
This commit is contained in:
@ -2,19 +2,18 @@
|
||||
|
||||
stack is an ADT (abstract data type ) that act like list of objects but there is a diffrents.
|
||||
|
||||
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 bast on two methods ( functions)
|
||||
|
||||
## push & pop
|
||||
## push & pop
|
||||
|
||||
**push**: add an alement to last index of stack.
|
||||
**push**: add an alement to last index of stack.
|
||||
|
||||
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`
|
||||
|
||||
|
||||
**pop**: remove the last element from stack.
|
||||
for example: we have `1, 3, 5 , 9` in stack, then we call pop(),
|
||||
|
||||
|
Reference in New Issue
Block a user