C Exercises: Insert new node at the end of a doubly linked list

C Linked List : Exercise-14 with Solution

Write a program in C to insert a new node at the end of a doubly linked list.
Test Data and Expected Output :

```Input the number of nodes : 3
Input data for node 1 : 2
Input data for node 2 : 5
Input data for node 3 : 8

Data entered in the list are :
node 1 : 2
node 2 : 5
node 3 : 8
Input data for the last node : 9

After insertion the new list are :
node 1 : 2
node 2 : 5
node 3 : 8
node 4 : 9
```

C Code:

```#include <stdio.h>
#include <stdlib.h>

struct node {
int num;
struct node * preptr;
struct node * nextptr;
}*stnode, *ennode;

void DlListcreation(int n);
void DlLinsertNodeAtEnd(int num);
void displayDlList(int a);

int main()
{
int n,num1,a;
stnode = NULL;
ennode = NULL;
printf("\n\n Doubly Linked List : Insert new node at the end in a doubly linked list :\n");
printf("------------------------------------------------------------------------------\n");
printf(" Input the number of nodes : ");
scanf("%d", &n);
DlListcreation(n);
a=1;
displayDlList(a);
printf(" Input data for the last node : ");
scanf("%d", &num1);
DlLinsertNodeAtEnd(num1);
a=2;
displayDlList(a);
return 0;
}

void DlListcreation(int n)
{
int i, num;
struct node *fnNode;

if(n >= 1)
{
stnode = (struct node *)malloc(sizeof(struct node));

if(stnode != NULL)
{
printf(" Input data for node 1 : "); // assigning data in the first node
scanf("%d", &num);

stnode->num = num;
stnode->preptr = NULL;
stnode->nextptr = NULL;
ennode = stnode;
for(i=2; i<=n; i++)
{
fnNode = (struct node *)malloc(sizeof(struct node));
if(fnNode != NULL)
{
printf(" Input data for node %d : ", i);
scanf("%d", &num);
fnNode->num = num;
fnNode->preptr = ennode;    // new node is linking with the previous node
fnNode->nextptr = NULL;
ennode->nextptr = fnNode;   // previous node is linking with the new node
ennode = fnNode;            // assign new node as last node
}
else
{
printf(" Memory can not be allocated.");
break;
}
}
}
else
{
printf(" Memory can not be allocated.");
}
}
}

void DlLinsertNodeAtEnd(int num)
{
struct node * newnode;

if(ennode == NULL)
{
printf(" No data found in the list!\n");
}
else
{
newnode = (struct node *)malloc(sizeof(struct node));
newnode->num = num;
newnode->nextptr = NULL;        // set next address field of new node  is NULL
newnode->preptr = ennode;       // previous address of new node is linking with ending node
ennode->nextptr = newnode;      // next address of ending node is linking with new node
ennode = newnode;               // set the new node as ending node
}
}

void displayDlList(int m)
{
struct node * tmp;
int n = 1;
if(stnode == NULL)
{
printf(" No data found in the List yet.");
}
else
{
tmp = stnode;
if (m==1)
{
printf("\n Data entered in the list are :\n");
}
else
{
printf("\n After insertion the new list are :\n");
}
while(tmp != NULL)
{
printf(" node %d : %d\n", n, tmp->num);
n++;
tmp = tmp->nextptr; // current pointer moves to the next node
}
}
}
```

Flowchart :

DlListcreation() :

DlLinsertNodeAtEnd() :

displayDlList() :

C Practice online:

```
#include <stdio.h>
#include <stdlib.h>

struct node {
int num;
struct node * preptr;
struct node * nextptr;
}*stnode, *ennode;

void DlListcreation(int n);
void DlLinsertNodeAtEnd(int num);
void displayDlList(int a);

int main()
{
int n,num1,a;
stnode = NULL;
ennode = NULL;
printf("\n\n Doubly Linked List : Insert new node at the end in a doubly linked list :\n");
printf("------------------------------------------------------------------------------\n");
printf(" Input the number of nodes : ");
scanf("%d", &n);
DlListcreation(n);
a=1;
displayDlList(a);
printf(" Input data for the last node : ");
scanf("%d", &num1);
DlLinsertNodeAtEnd(num1);
a=2;
displayDlList(a);
return 0;
}

void DlListcreation(int n)
{
int i, num;
struct node *fnNode;

if(n >= 1)
{
stnode = (struct node *)malloc(sizeof(struct node));

if(stnode != NULL)
{
printf(" Input data for node 1 : "); // assigning data in the first node
scanf("%d", &num);

stnode->num = num;
stnode->preptr = NULL;
stnode->nextptr = NULL;
ennode = stnode;
for(i=2; i<=n; i++)
{
fnNode = (struct node *)malloc(sizeof(struct node));
if(fnNode != NULL)
{
printf(" Input data for node %d : ", i);
scanf("%d", &num);
fnNode->num = num;
fnNode->preptr = ennode;    // new node is linking with the previous node
fnNode->nextptr = NULL;
ennode->nextptr = fnNode;   // previous node is linking with the new node
ennode = fnNode;            // assign new node as last node
}
else
{
printf(" Memory can not be allocated.");
break;
}
}
}
else
{
printf(" Memory can not be allocated.");
}
}
}

void DlLinsertNodeAtEnd(int num)
{
struct node * newnode;

if(ennode == NULL)
{
printf(" No data found in the list!\n");
}
else
{
newnode = (struct node *)malloc(sizeof(struct node));
newnode->num = num;
newnode->nextptr = NULL;        // set next address field of new node  is NULL
newnode->preptr = ennode;       // previous address of new node is linking with ending node
ennode->nextptr = newnode;      // next address of ending node is linking with new node
ennode = newnode;               // set the new node as ending node
}
}

void displayDlList(int m)
{
struct node * tmp;
int n = 1;
if(stnode == NULL)
{
printf(" No data found in the List yet.");
}
else
{
tmp = stnode;
if (m==1)
{
printf("\n Data entered in the list are :\n");
}
else
{
printf("\n After insertion the new list are :\n");
}
while(tmp != NULL)
{
printf(" node %d : %d\n", n, tmp->num);
n++;
tmp = tmp->nextptr; // current pointer moves to the next node
}
}
}
```

Improve this sample solution and post your code through Disqus.

﻿