# Program to find size of Doubly Linked List in C++

C++Server Side ProgrammingProgramming

#### C in Depth: The Complete C Programming Guide for Beginners

45 Lectures 4.5 hours

#### Practical C++: Learn C++ Basics Step by Step

Most Popular

50 Lectures 4.5 hours

#### Master C and Embedded C Programming- Learn as you go

66 Lectures 5.5 hours

In this problem, we are given a doubly linked list. Our task is to create a program to find size of Doubly Linked List in C++.

Doubly Linked List is a special type of Linked list in which navigation is possible in both ways, either forward and backward easily as compared to Single Linked List. The following are the important terms to understand the concept of doubly linked lists.

• Link − Each link of a linked list can store a data called an element.

• Next − Each link of a linked list contains a link to the next link called Next.

• Prev − Each link of a linked list contains a link to the previous link called Prev.

• LinkedList − A Linked List contains the connection link to the first link called First and to the last link called Last.

Representation of a Doubly Linked List − Problem Description − We will be given a doubly linked list of the above type. And we will find the size (length) of it.

Let’s take an example to understand the problem,

## Input

the above linked list A <-> B <-> C.

## Output

3

## Solution Approach

To find the size of the doubly linked list, we need to traverse the doubly linked list and keep track of the length with the length valable.

### Algorithm

Initialise − length = 0, *temp = head

• Step 1 − Traverse the list i.e. do till the temp != NULL.
• Step 1.1 − Increase length, length++
• Step 1.2 − Update pointer, temp = temp -> next.
• Step 2 − print length.

Program to illustrate the working of our solution

## Example

Live Demo

#include <iostream>
using namespace std;
struct doublyLL {
char val;
struct doublyLL *next;
struct doublyLL *prev;
};
void insertNode(struct doublyLL** head_ref, int value){
struct doublyLL* new_node = new doublyLL;
new_node->val = value;
new_node->prev = NULL;
if ((*head_ref) != NULL)
(*head_ref)->prev = new_node ;
}
int calcDLLSize(struct doublyLL *temp) {
int length = 0;
while (temp != NULL){
temp = temp->next;
length++;
}
return length;
}
int main(){
struct doublyLL* head = NULL;
}
The size of Doubly Linked List is 6