C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C Prime Number code in C Factorial Program in C using For Loop Factorial Program in C Using While Loop Fibonacci Series in C Using For Loop Fibonacci series in C using while loop Prime Number Program in C using for Loop While Loop in C programming examples Built-in functions in C Assert() Function C vs Java Strings Call Back Function in Embedded C Else If Ladder fgets() function Ftell() Function getc() function getch() function gets() function Heap Sort Nested if-else statement Pi() Function Positioning of file Write() function abs() function in C Attributes in C C program to find factorial of a number using Recursion Ferror() in c fopen() function in C Fibonacci series program in C using Recursion Formatted Input and output function in C Snake Game in C User Defined Functions in C Beep() function in C Cbrt() function in C Hook() function in C Isalnum() function in C C Program to find the Roots of a Quadratic Equation C Switch Statements Difference between rand() and srand() function in C Difference between while and for loop in C Doubly Linked list in C Example of Iteration in C How to use atoi() function in C How to use floor() function in C How to use sine() function in C How to use Typedef Struct in C Integer Promotions in C C Program Swap Numbers in cyclic order Using Call by Reference C Program to Find Largest Number Using Dynamic Memory Allocation C Program to Find the Largest Number using Ternary Operator C/C++ Program to Find the Size of int, float, double and char Find the Largest Three Distinct Elements in an Array using C/C++ Loop Questions in C Modulus on Negative Numbers in C Multiplication table program in C using For loop Nested Loops in C Programming Examples C Program for Mean and Median of an Unsorted Array Results of Comparison Operations in C and C++ Reverse a Stack using Recursion in C Simple hash() function in C strcat() Function in C Sum of N numbers in C using For loop Use of free() function in C Write a program that produces different results in C and C++ C Function Argument and Return Values Keywords in C Bank management system in C Calendar application in C Floor() Function in C Free() Function in C How to delete a file in C How to move a text in C Remove an element from an array in C Unformatted input() and output() function in C What are linker and loader in C fork() in C GCD program in C Branching Statements in C Comma Operator in C Control statement in C Double Specifier in C How to create a binary file in C Long int in C Palindrome Number in C Pure Virtual Function in C Run Time Polymorphism in C Types of Array in C Types of Function in C What is a buffer in C What is required in each C Program Associativity of Operators in C Bit Stuffing Program in C Actual and Formal Parameters Addition of two Numbers in C Advantages of function in C Arithmetic Progression Program in C Binomial Coefficient Program in C Difference between Array and List in C Diffie-Hellman Algorithm in C How to convert a number to words in C How to convert a string to hexadecimal in C Difference between If and Switch Statement in C

Doubly Linked list in C

To know the Doubly Linked List in C, first we should know about how the Linked List works.

Linked List

The Linked list is the linear data structure. In the Linked List the elements are stored in the nodes. The Nodes consists of Data part and Address of the next node.

Doubly Linked List in C

In the above diagram shows the representation of the Single Linked list, every node consists of data and address of the next node. The first node in Linked list is referred as the “Head” and Last node is referred as “Tail”. The execution of the Linked List is done by pointers. In Single Linked List, the traversing is done only in forward Direction.

Difference Between Array and Linked List

Array:

In the array, the size of the array should be declared at first so, the array can’t deal with the dynamic programs which are needed to increase or decrease the size according to the problem and inserting the new elements at a position disturbs the locations of other elements. i.e., The Array is used in the static programming.

Linked List:

In the Linked List, the size of the linked list is not declared initially, we can be able to add/ delete elements according to problem. The Insertion of the elements doesn’t disturb the elements location as it is stores as dynamically and linked together with using pointers.

Syntax for declaring a Linked List.

The implementation of Linked list in C programming languages is done by the Structures and Pointers.

struct node
{
int data;
struct *next;
};

In the above code, we have declared a nose using structure and a variable for data and Pointer variable next to store the address of the next Node.

Types of Linked List:

 Four types of Linked Lists are:

  1. Single Linked List.
  2. Doubly Linked List.
  3. Circular single Linked List.
  4. Circular Doubly Linked List.

Doubly Linked List:

 It contains three parts. The first part is the address of previous node, data part and address of next node.

Doubly Linked List in C

In the above diagram shows the representation of the Doubly Linked List. The “previous” part in a node contains the address of the previous node. The “next” part contains the address of the next node.

In the doubly linked list, the traversing can be done by both ways i.e., Forward and Backward.

Syntax

Syntax for declaring a double Linked List:

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

In the above code, a node is created using structures and a pointer variables prev and next, and an integer variable data.

The previous part value of the Head Node and Next part value of Tail node is NULL. Because the head is a first node it doesn’t contains any previous nodes so the previous is NULL, and the Tail node is the last node and it doesn’t contains any further nodes so , the next is NULL.

Program (for Doubly Linked List):

// using menu-driven method.
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct Node
{
struct Node *prev;
int data;
struct Node *next;
};
struct Node *head = NULL, *tail = NULL, *temp;
void insertionAtLast(int ele);
void deletionAtLast(void);
void insertionAtFirst(int ele);
void deletionAtFirst(void);
void insertionAtPosition(int ele, int pos);
void deletionAtPosition(int pos);
void traverse(void);
void insertionAtLast(int ele)
{
temp = (struct Node *)malloc(sizeof(struct Node));
temp->prev = NULL;
temp->data = ele;
temp->next = NULL;
if(head == NULL) // When list is not having any nodes.
{
head = tail = temp;
}//if
else // When list is having atleast one node.
{
tail->next = temp;
temp->prev = tail;
tail = temp;
}//else
}//insertionAtLast
void deletionAtLast(void)
{
if(head == NULL) // When list is empty.
{
printf("\nThe list is empty");
}//if
else if(head == tail) // When list is Having only one node.
{
head = tail = NULL;
}//else if
else // When list is having more than one node.
{
temp = tail;
tail = tail->prev;
tail->next = NULL;
free(temp);
}//else
}//deletionAtLast
void insertionAtFirst(int ele)
{
temp = (struct Node *)malloc(sizeof(struct Node));
temp->data = ele;
temp->next = NULL;
if(head == NULL) // When list is not having any nodes.
{
head = tail = temp;
}//if
else // When list is having atleast one node.
{
temp->next = head;
head->prev = temp;
head = temp;
}//else
}//insertionAtFirst
void deletionAtFirst(void)
{
if(head == NULL) // When list is empty.
{
printf("\nThe list is empty");
}//if
else if(head == tail) // When list is Having only one node.
{
head = tail = NULL;
}//else if
else // When list is having more than one node.
{
temp = head; // Assiging first node to temp.
head = head->next;
head->prev = NULL;
free(temp); // Deleting first node from memory.
}//else
}//deletionAtFirst
void insertionAtPosition(int ele, int pos)
{
struct Node *curr;
int i;
if(pos == 1)
{
insertionAtFirst(ele);
}//if
else
{
temp = (struct Node *)malloc(sizeof(struct Node));
temp->data = ele;
temp->next = NULL;
curr = head;
for(i=1; i<pos-1; i++) // Moving to previous of target position
{
curr = curr->next;
}//for
if(curr == NULL)
{
printf("\n Insertion not possible, Position out of range ");
}//if
else
{
temp->next = curr->next;
curr->next->prev = temp;
curr->next = temp;
temp->prev = curr;
if(curr == tail)
{
tail = temp;
}//if
}//else
}//else
}//insertionAtPosition
void deletionAtPosition(int pos)
{
int i;
if(head == NULL)
{
printf("\nList is empty");
}//if
else if(pos == 1)
{
deletionAtFirst();
}//else if
else
{
temp = head;
for(i=1; i<pos-1; i++) // Moving to previous of target position
{
temp = temp ->next;
}//for
if(temp == NULL)
{
printf("\n Deletion not possible, Position out of range");
}//if
else
{
if(temp->next == tail)
{
tail = temp;
tail->next = NULL;
}//if
else
{
temp->next = temp->next->next;
temp->next->prev = temp;
}//else
}//else
}//else
}//deletionAtPosition
void traverse(void)
{
if(head == NULL)
{
printf("\nList is empty");
}//if
else
{
temp = head;
while(temp != tail) // Diplaying all nodes except last one.
{
printf("%d <-> ", temp->data);
temp = temp -> next;
}//while
printf("%d ", temp->data);
}//else
}//traverse
void main(void)
{
int choice, ele, pos, key ;
clrscr();
while(1)
{
printf("\n \t Doubly Linked List Operations\n");
printf("1. Insert Last \n");
printf("2. Delete Last \n");
printf("3. Insert First \n");
printf("4. Delete First \n");
printf("5. Insert At Position \n");
printf("6. Delete At Position \n");
printf("7. Traverse the DLList \n");
printf("8. Exit\n");
printf("\nEnter your choice:");
scanf("%d", &choice );
switch ( choice )
{
case 1 :
printf("\nEnter the element:");
scanf("%d",&ele);
insertionAtLast(ele);
break;
case 2 :
deletionAtLast();
break;
case 3 :
printf("\nEnter the element:");
scanf("%d",&ele);
insertionAtFirst(ele);
break;
case 4 :
deletionAtFirst();
break;
case 5 :
printf("\nEnter the element:");
scanf("%d",&ele);
printf("\nEnter the position:");
scanf("%d",&pos);
insertionAtPosition(ele,pos);
break;
case 6 :
printf("\nEnter the position:");
scanf("%d",&pos);
deletionAtPosition(pos);
break;
case 7 :
traverse();
break;
case 8 :
exit(0);
default :
printf("\ninvalid choice!!!! try again!!!!\n");
break;
}//switch
}//while
}//main

Output:

Doubly Linked List Operations
1.Insert Last
2.Delete Last
3.Insert First
4.Delete First
5.Insert At Position
6.Delete At Position
7.Traverse the DLList
8.Exit
Enter your choice : 1
Enter the element:10
Doubly Linked List Operations
1.Insert Last
2.Delete Last
3.Insert First
4.Delete First
5.Insert At Position
6.Delete At Position
7.Traverse the DLList
8.Exit
Enter your choice : 8

Summary:

The doubly linked list contains previous address, next address, and data. The doubly linked list is used in the implementation of tree data structure. It is also used in undo and redo operations.



ADVERTISEMENT
ADVERTISEMENT