Types of linked list

Types of Linked Lists

There are 3 different implementations of Linked List available, they are:
  1. Singly Linked List
  2. Doubly Linked List
  3. Circular Linked List
Let's know more about them and how they are different from each other.

Singly Linked List

Singly linked lists contain nodes which have a datapart as well as an address part i.e. next, which points to the next node in the sequence of nodes.
The operations we can perform on singly linked lists are insertiondeletion and traversal.
Linear Linked List

Doubly Linked List

In a doubly linked list, each node contains a datapart and two addresses, one for the previous node and one for the next node.
Double Linked List

Circular Linked List

In circular linked list the last node of the list holds the address of the first node hence forming a circular chain.
Circular Linked List

Comments

Popular posts from this blog

Introduction of Digital computer

INTRODUCTION OF DBMS

Introduction to cache memory