Chapter 5

Linked List

Chapter 5 discusses and exemplifies the data structure called linked list. The static and dynamic representations of linked list are clearly explained. A rigorous discussion of singly linked lists, circular linked lists and doubly linked lists along with their representation and operations is given. The chapter also compares various types of linked list along with arrays. This chapter continues with advantages, disadvantages, applications and ADT, i.e. Abstract Data Type of Linked Lists.

5.1 INTRODUCTION

Arrays are linear data structure for which memory should be allocated in advance to maintain the adjacency of the data elements. Once the memory is allocated, it cannot be extended as per the need. So, arrays are static ...

Get Data Structures and Algorithms Using C++ now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.