Page 29 - DCAP605_ADVANCED_DATA_STRUCTURE_AND_ALGORITHMS

Advanced Data Structure and Algorithms Anil Sharma, Lovely Professional University

Notes Unit 2: Linked Lists

CONTENTS

Objectives
Introduction
2.1 Concept of Linked Lists
2.2 Representation of Linked List
2.3 Inserting a Node using Recursive Programs

2.4 Deleting the Specified Node in Singly Linked List

2.5 Inserting a Node after the Specified Node in a Singly Linked List
2.6 Linked List Common Errors
2.7 Doubly Linked Lists

2.8 Circular Linked List
2.9 Sorting and Reversing a Linked List
2.10 Merging two Sorted Lists
2.11 Merging of two Circular Lists
2.12 Application of Linked List

2.13 Summary
2.14 Keywords
2.15 Self Assessment
2.16 Review Questions

2.17 Further Readings
Objectives

After studying this unit, you will be able to:

Define linked lists
Describe linked lists representation
Know doubly linked lists
Explain circular linked lists

Introduction

There are many other operations that are also useful to apply to sequences of elements. Thus we
can form a wide variety of similar ADTs by utilizing different packages of operations. Any one of
these related ADTs could reasonably go by the name of list. However, we fix our attention on one

particular list ADT whose operations give a representative sampling of the ideas and problems
that arise in working with lists.

24 LOVELY PROFESSIONAL UNIVERSITY