From e8dd96f73a217389978e3bfbee2de5094eed7761 Mon Sep 17 00:00:00 2001 From: varchasva-tiwari Date: Tue, 16 Oct 2018 09:46:23 +0530 Subject: [PATCH] Add info to article. (#19196) A stack is a First In Last Out (FILO) or Last In First Out (LIFO) Data Structure --- .../english/computer-science/data-structures/stacks/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/client/src/pages/guide/english/computer-science/data-structures/stacks/index.md b/client/src/pages/guide/english/computer-science/data-structures/stacks/index.md index eb0bbf4af54..85372c26816 100644 --- a/client/src/pages/guide/english/computer-science/data-structures/stacks/index.md +++ b/client/src/pages/guide/english/computer-science/data-structures/stacks/index.md @@ -3,7 +3,7 @@ title: Stacks --- ## Stacks -A stack is a First In Last Out (FILO) Data Structure. It is a linear data structure. +A stack is a First In Last Out (FILO) or Last In First Out (LIFO) Data Structure. It is a linear data structure. You can imagine a stack as the way plates were organized in buffet restaurant. You can only pick the plate at the top otherwise the stack will collapse. Generally, the last item to be inserted will be removed first.