Skip to content

Fix misleading phrase "arrays of lists" in stack implementation description #253

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix misleading phrase "arrays of lists" in stack implementation description #253

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion en/Data Structures/Stacks/stack.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
A stack is a basic linear data structure that follows an order in which objects are accessed. The order is called LIFO(Last In First Out)or FILO(First in Last Out).
A perfect example of stacks would be plates in a canteen, a pile of books, or a box of Pringles,etc.
Stacks are used to implement parsers and evaluation expressions and backtracking algorithms. basic operations are pushing an element into the stack and popping the element out of the stack.
We can make use of linked lists or arrays of lists. The stack contains only one pointer
Stacks can be implemented using either arrays or linked lists. The stack contains only one pointer
"top pointer" which points to the topmost elements of the stack. Insertion and deletion only occurs at one end of the stack.

# Standard Stack Operations
Expand Down