Chapter 4

Stacks

Chapter Outline

4.1 Introduction

4.2 Stack-related Terms

4.3 Stack Implementation

4.4 Operation on Stack

4.5 Pointers and Stack

4.6 Representation of Arithmetic Expressions

4.7 Infix, Prefix, and Postfix Notations

4.8 Evaluation of Postfix Expression

4.9 Conversion of Expression from Infix to Postfix

4.10 Applications of Stacks

4.11 Activation Record Organization

4.12 Scope Rules

4.13 Scope Rules through Stack

4.1 INTRODUCTION

In this chapter, we will study one of the most important simple data structures ‘stack’. Stack is an important tool in programming languages. Stack is one of the most essential linear data structures. Implementation of most of the system programs is based on stack data structure. We can insert or delete ...

Get Introduction to Data Structures in C now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial