Seminar

on
LINKED LISTS Presented By : Dalvi Mahendra S.

Content Outline

Introduction Anatomy of Linked list Types of Linked list Operations Advantages Application Conclusion References Questions? Thank You !

Introduction

A linked list is a linear collection of data elements, called nodes, where the linear order is given by means of pointers. Each node is divided into two parts: The first part contains the information of the element and The second part contains the address of the next node (link /next pointer field) in the list.

Anatomy of a linked list

A linked list consists of:

A sequence of nodes

Header

Each node contains a value and a link (pointer or reference) to some other node The last node contains a null link The list may (or may not) have a header
4

More terminology

A nodes successor is the next node in the sequence

The last node has no successor

A nodes predecessor is the previous node in the sequence

The first node has no predecessor A list may be empty (contain no elements)

A lists length is the number of elements in it

Types of Linked List

There are three types of linked list

Singly Linked list Doubly Linked list Circular Linked list

Singly-linked lists

Here is a singly-linked list (SLL):

myList a b c d

Each node contains a value and a link to its successor (the last node has no successor) The header points to the first node in the list (or contains the null link if the list is empty)

Doubly-linked lists

Here is a doubly-linked list (DLL):

Head a b

Each node contains a value, a link to its successor (if any), and a link to its predecessor (if any) The header points to the first node in the list and to the last node in the list (or contains null links if the list is empty)

Circular Linked Lists

Circular linked lists

The last node points to the first node of the list

A Head

Linked List Operations

Create Print Traverse Insertion Deletion Searching etc.

10

Advantages

Linked List is an example of dynamic data structure. Representation of linear data sructure. Efficient memory utilization. Insertion and Deletion are easier and efficient.

11

Applications

Polynomials as Linked List In Buddy Sytem

12

Overview

Introduction Anatomy of Linked list Types of Linked list Operations Advantages Applications.

13

References
1) Data Structures A Pseudocode Approach with C
Second Edition Richard F.Gilerg & Behrouz A.Forouzan. 2) Data Structures & Algorithms Dilip kumar Sultania.

14

Conclusion
Linked list is a good structure as compare to array because data are easily inserted and deleted at the beginning,in the middle,or at the end of the list. Using Linked List data structure we can maintain and process lists.

15

Questions?

16

Thank You !

17

LINKED LISTS

18