Introduction to Data Structures in C

Chapter 6

Static List and Linked List

Chapter Outline

6.1 Introduction

6.2 Implementation of List

6.3 Traversal of List

6.4 Searching and Retrieving an Element

6.5 Predecessor and Successor

6.6 Insertion

6.7 Deletion

6.8 Sorting

6.9 Merging List

6.10 Linked List

6.11 Important Terms

6.12 Memory Allocation and De-allocation

6.13 Operations on Linked Lists

6.14 Singly Linked List

6.15 Linked List with Header

6.16 Linked List without Header

6.17 Insertion in the Linked List

6.18 Insertion of Node at Start

6.19 Insertion of Node at End

6.20 Insertion of Node at a Given Position

6.21 Reversing the Singly Linked List

6.22 Concatenation of Two Lists

6.23 Splitting of a Linked List

6.24 Circular Linked List

6.25 Method for Detecting End

6.26 Doubly ...