Given a doubly linked list, the task is to find the size of that doubly linked list. For example, size of below linked list is 4.

A doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes.

Traversal of a doubly linked list can be in either direction. In fact, the direction of traversal can change many times, if desired.

For example the function should return 3 for the above doubly linked list.

## Algorithm :

1) Initialize size to 0.

2) Initialize a node pointer, temp = head.

3) Do following while temp is not NULL

……a) temp = temp -> next

……b) size++;

4) Return size.

`// A complete working C++ program to ` `// find size of doubly linked list. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// A linked list node ` `struct` `Node ` `{ ` ` ` `int` `data; ` ` ` `struct` `Node *next; ` ` ` `struct` `Node *prev; ` `}; ` ` ` `/* Function to add a node to front of doubly ` ` ` `linked list */` `void` `push(` `struct` `Node** head_ref, ` `int` `new_data) ` `{ ` ` ` `struct` `Node* new_node = ` `new` `Node; ` ` ` `new_node->data = new_data; ` ` ` `new_node->next = (*head_ref); ` ` ` `new_node->prev = NULL; ` ` ` `if` `((*head_ref) != NULL) ` ` ` `(*head_ref)->prev = new_node ; ` ` ` `(*head_ref) = new_node; ` `} ` ` ` `// This function returns size of linked list ` `int` `findSize(` `struct` `Node *node) ` `{ ` ` ` `int` `res = 0; ` ` ` `while` `(node != NULL) ` ` ` `{ ` ` ` `res++; ` ` ` `node = node->next; ` ` ` `} ` ` ` `return` `res; ` `} ` ` ` `/* Drier program to test above functions*/` `int` `main() ` `{ ` ` ` `struct` `Node* head = NULL; ` ` ` `push(&head, 4); ` ` ` `push(&head, 3); ` ` ` `push(&head, 2); ` ` ` `push(&head, 1); ` ` ` `cout << findSize(head); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

4

## Recommended Posts:

- Reverse a doubly linked list in groups of given size
- Find pairs with given sum in doubly linked list
- Find the largest node in Doubly linked list
- Find pairs with given product in a sorted Doubly Linked List
- Difference between Singly linked list and Doubly linked list
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- QuickSort on Doubly Linked List
- Reverse a Doubly Linked List
- Reverse a Doubly Linked List | Set-2
- Reverse a Doubly linked list using recursion
- Memory efficient doubly linked list
- Delete all occurrences of a given key in a doubly linked list
- Sort the biotonic doubly linked list | Set-2
- Implementation of Deque using doubly linked list

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.