C Program for Create and Traverse Doubly Linked List | BitsOfCS

 So, we have to write a C program that creates and traverses the doubly linked list. Take care while handling the pointers in the program, because we are going to manipulate lots of pointers.

Also read: Doubly Linked List

Declaring the Doubly Linked List:

So, we know that we can declare elements(nodes) of doubly linked list using self referential structure. 

Example of self referential structure:

Function Definition:

In our program, we have two functions i.e. first function to create the doubly linked list and second to traverse the doubly linked list.

1. void create_list(int); This function helps to create the doubly linked list. create_list() function takes an integer as an argument that creates the number of nodes in the doubly linked list and returns nothing.
2. void trav_f(void); This function helps to traverse the doubly linked list in forward direction. trav_f() function takes nothing as input and returns nothing.
3. void trav_b(void); This function helps to traverse the doubly linked list in backward direction. trav_b() function takes nothing as input and returns nothing.

C program for Create and Traverse Singly Linked List:

Output-

This is how our doubly linked list looked like: