About this document
Understanding Stacks: Operations & Implementation by K. Naga Raju is a document available to read on EtoBox.
The document discusses stacks, which are linear data structures where insertion and deletion occur at one end called the top. Stacks follow a last-in, first-out principle. They can be implemented using arrays or linked lists. Stacks have applications in parsing, function calls, recursion, arithmetic expression conversion/evaluation using Polish notation. The document provides code examples of implementing stacks using arrays and linked lists, and an algorithm to convert infix notation to postfix notation.
- Author
- K. Naga Raju
- Language
- EN