Program to Delete a Linked List

Write a program to delete a linked list. Given a linked list, we have to write a code to delete a linked list.

To delete a complete linked list, traverse all the nodes of a linked list and delete one by one.

Print Middle Element of a Linked List

How to Delete a Linked List

To delete a node one by one maintain two pointers.  The first pointer points to head and the second pointer keeps the reference to next node. So when a node is free, you can assign the reference of next node using the second pointer.

Count Number of Nodes in a Linked List

Write a c program to count number of nodes in a linked list. In this tutorial, We are going to write a c code to count the number of nodes in a linked list.

What is Linked List?

A linked list is a collection of nodes, each pointing to next node by means of a pointer. In linked list, each node consists of two parts, a data and a pointer to next node.

C Program to Count Number of Nodes in a Linked List

C Program to Count Number of Nodes in a Linked List

An Algorithm to Count Number of Nodes in a Linked List

i) Take a count variable and initialize it to zero, count = 0.

ii) Traverse a linked list and increment a count variable.

iii) When a node points to a null, it means we reach at end of a linked list then return the value of a count variable.