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.
1) Initialize size to 0.
2) Initialize a node pointer, temp = head.
3) Do following while temp is not NULL
……a) temp = temp -> next
4) Return size.
- 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
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Difference between Singly linked list and Doubly linked list
- QuickSort on Doubly Linked List
- Reverse a Doubly Linked List | Set-2
- Reverse a Doubly Linked List
- Priority Queue using doubly linked list
- Memory efficient doubly linked list
- Insertion Sort for Doubly Linked List
- Doubly Linked List | Set 1 (Introduction and Insertion)
- Bubble Sort On 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 email@example.com. 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.