Data Structure Using C

Chapter 6

Linked Lists

CHAPTER OUTLINE

6.1 Introduction

6.2 Linked Lists

6.3 Operations on Linked Lists

6.4 Variations of Linked Lists

6.5 The Concept of Dummy Nodes

6.6 Linked Stacks

6.7 Linked Queues

6.8 Comparison of Sequential and Linked Storage

6.9 Solved Problems

6.1 INTRODUCTION

An array is a very simple and extremely useful data structure. A large number of applications based on stacks and queues can be easily implemented with the help of arrays. Lists and tables have natural similarity with one- and two-dimensional arrays. Though the allocation of space is sequential in an array, the access to its elements is random. For a given index the element can be accessed in a time, independent of its location in the array.

However, there ...