The provided code implements a Stack data structure using a std::vector in C++. A stack is a linear data structure that follows the LIFO (Last-In, First-Out) principle, meaning the last element added is the first one to be removed.
-
Notifications
You must be signed in to change notification settings - Fork 0
The provided code implements a Stack data structure using a std::vector in C++. A stack is a linear data structure that follows the LIFO (Last-In, First-Out) principle, meaning the last element added is the first one to be removed.
ansh-rohilla/Stack---Using-Vectors
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The provided code implements a Stack data structure using a std::vector in C++. A stack is a linear data structure that follows the LIFO (Last-In, First-Out) principle, meaning the last element added is the first one to be removed.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published