From a0ae29736e5fb034fb8f3c5667b3501ea0e03ddc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Mondrag=C3=B3n?=
 <110652280+danmondra@users.noreply.github.com>
Date: Wed, 9 Apr 2025 23:54:33 -0600
Subject: [PATCH] Update stack.md

---
 en/Data Structures/Stacks/stack.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/en/Data Structures/Stacks/stack.md b/en/Data Structures/Stacks/stack.md
index b15b3527..75f712d3 100644
--- a/en/Data Structures/Stacks/stack.md	
+++ b/en/Data Structures/Stacks/stack.md	
@@ -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