https://www.devkuma.com/en/tags/stack/ https://www.devkuma.com/en/tags/stack/logo/180x180.jpg https://www.devkuma.com/en/tags/stack/ Recent content in Stack on devkuma Hugo -- gohugo.io en kc@example.com (kc kim) kc@example.com (kc kim) The devkuma https://www.devkuma.com/en/docs/data-structure/stack/ Sun, 10 Apr 2022 01:49:00 +0900 kc@example.com (kc kim) https://www.devkuma.com/en/docs/data-structure/stack/ <h2 id="concept-of-a-stack">Concept of a Stack</h2> <ul> <li>A stack means a pile of things.</li> <li>It is a LIFO(Last In First Out) data structure where data can be inserted and removed only from one end. <ul> <li>The most recently added data is removed first.</li> </ul> </li> </ul> <h2 id="structure-of-a-stack">Structure of a Stack</h2> <ul> <li>Top of stack: top</li> <li>Bottom of stack: not needed</li> <li>Element, item</li> <li>Insert/delete operations</li> </ul> <p><img src="https://www.devkuma.com/docs/data-structure/stack-1.png" alt="Stack"></p> <h2 id="stack-operations">Stack Operations</h2> <p>A stack follows LIFO(Last In First Out). In other words, the item most recently added to the stack is the first item to be removed.</p> <ul> <li>push(x): adds the given element x to the top of the stack.</li> <li>pop(): if the stack is not empty, removes and returns the top element.</li> <li>isEmpty(): returns true if the stack is empty, otherwise false.</li> <li>peek(): if the stack is not empty, returns the top element without removing it.</li> <li>isFull(): returns true if the stack is full, otherwise false.</li> <li>size(): returns the number of all elements in the stack.</li> <li>display(): outputs all elements in the stack.</li> </ul> <h2 id="uses-of-a-stack">Uses of a Stack</h2> <ul> <li>Function calls</li> <li>Stacks are useful when using recursive algorithms. <ul> <li>Recursive algorithms <ul> <li>When functions must be called recursively, temporary data is pushed onto the stack.</li> <li>When returning from recursive functions and performing backtracking, the temporary data pushed onto the stack must be popped.</li> <li>A stack makes this sequence of actions intuitive.</li> <li>A stack also makes it possible to implement recursive algorithms in an iterative form.</li> </ul> </li> </ul> </li> <li>Web browser history(back button)</li> <li>Undo</li> <li>Creating reversed strings</li> <li>Checking parentheses in expressions(parentheses checks for operator precedence) <ul> <li>Example: determining a Valid Parenthesis String(VPS)</li> </ul> </li> <li>Calculators(postfix notation calculation)</li> </ul> <p><img src="https://www.devkuma.com/docs/data-structure/stack-2.png" alt="Stack use cases"></p> <h2 id="references">References</h2> <ul> <li><a href="https://gmlwjd9405.github.io/2018/08/03/data-structure-stack.html" target="_blank" rel="noopener">Data Structure | What Is a Stack?<i class="fas fa-external-link-alt"></i></a></li> </ul> Data Structure Stack