{"post":"

Find the Length of a Linked List

THEORY:

Calculating the Length of a linked list is pretty easy, given we have already seen how to get an element in a linked list (see Search for element).

Input : [1,3,4,5]

Output: 4

# Algorithm

We intend to do as follows:

Create a linked list
Create some nodes of this list.
Iterate till we reach an element whose node points to NULL
Initialize count as 0, and increment at each iteration

Code:

#include <iostream>\r\nusing namespace std;\nstruct Node{\r\nint data;\r\nNode * next;\r\n};
\nvoid searchList(Node *n){\r\nint count = 0;\r\ndo {\r\ncount++;\r\nn = n->next;\r\n} while (n != NULL);\r\ncout << \"Length of list is \" << count << endl;\r\n}
\nint main(){\r\nNode *head = NULL;\r\nNode *second = NULL;\r\nNode *third = NULL;\r\nNode *fourth = NULL;\r\nNode *fifth = NULL;
\nhead = new Node();\r\nsecond = new Node();\r\nthird = new Node();\r\nfourth = new Node();\r\nfifth = new Node();\r\n\r\nhead-&gt;data = 2;\r\nsecond-&gt;data = 16;\r\nthird-&gt;data = 13;\r\nfourth-&gt;data = 1;\r\nfifth-&gt;data = 34;\r\n\r\nhead-&gt;next = second;\r\nsecond-&gt;next = third;\r\nthird-&gt;next = fourth;\r\nfourth-&gt;next = fifth;\r\nfifth-&gt;next = NULL;\r\n\r\nsearchList(head);\r\nreturn 0;\n
\n}

Output:

Length of list is 5

This is how we find the length of a linked list.

\n","title":"Find the Length of a Linked List","authorDetails":{"name":"Anshuman Raina","slug":"anshuman-raina"},"description":null,"slug":"find-the-length-of-a-linked-list/","articleId":"636a83417bb1ce5072622b49","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}