Doubly Linked List introduction

Doubly Linked List introduction

a doubly-linked list is similar to the singly linked list, this is two way linked list. each node on the doubly linked list contains the address of the previous node and address of the next node.

structure of doubly linked list :

struct node
struct node *prev;
int data;
struct node *next;

first node previous address field should be NULL, because its the starting node

last node next address field should be NULL because its the ending node of doubly linked list

Last updated on by vishal devxo