📚 Stack Data Structure – Implementations & Applications This repository contains C/C++ implementations of the Stack data structure and its most common applications. Stacks follow the LIFO (Last In, First Out) principle — the last element added is the first one removed. We cover stack basics and real-world use cases like expression evaluation, parenthesis matching, and more. 🚀 Features ✅ Stack implementation using arrays ✅ Stack implementation using linked lists ✅ Infix to Postfix conversion and evaluation ✅ Balanced parenthesis checker ✅ String reversal ✅ Custom stack operations (push, pop, peek, size, isEmpty, isFull) ✅ Decimal to binary conversion