Types of linked list - Doubly linked list list.ppt

Data Structures

1. Data Structures: A Pseudocode Approach
with C 1
Doubly Linked List

A doubly linked list is a linked list structure in which each node
has a pointer to both its successor and its predecessor.

2. Data Structures: A Pseudocode Approach
with C 2

3. ADT Structure
Data Structures: A Pseudocode Approach
with C 3
There are three pieces of metadata in the head structure: a
count, a position pointer for traversals, and a rear pointer:

4. Data Structures: A Pseudocode Approach
with C 4
Circularly Linked List

In a circularly linked list, the last node’s link points to
the first node of the list.

Circularly linked lists are primarily used in lists that
allow access to nodes in the middle of the list without
starting at the beginning.

5. Data Structures: A Pseudocode Approach
with C 5