C Program Find the Length of Linked List without Recursion

This C Program, using iteration, counts the number of nodes in a linked list. A linked list is an ordered set of data elements, each containing a link to its successor.

Here is the source code of the C program to count the number of nodes in a linked list. The C Program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C Program find the Length of the Linked List without using Recursion

```
 */
```
```
#include <stdio.h>
```
```
#include <stdlib.h>
```
```
 
```
```
struct node
```
```
{
```
```
    int a;
```
```
    struct node *next;
```
```
};
```
```
 
```
```
 
```
```
void generate(struct node **);
```
```
int length(struct node*);
```
```
void delete(struct node **);
```
```
 
```
```
int main()
```
```
{
```
```
    struct node *head = NULL;
```
```
    int count;
```
```
 
```
```
    generate(&head);
```
```
    count = length(head);
```

    printf("The number of nodes are: %d\n", count);

```
    delete(&head);
```
```
 
```
```
    return 0;
```
```
}
```
```
 
```
```
void generate(struct node **head)
```
```
{
```

    /* for unknown number of nodes use num = rand() % 20; */

```
    int num = 10, i;
```
```
    struct node *temp;
```
```
 
```
```
    for (i = 0; i < num; i++)
```
```
    {
```

        temp = (struct node *)malloc(sizeof(struct node));

```
        temp->a = i;
```
```
        if (*head == NULL)
```
```
        {
```
```
            *head = temp;
```
```
            (*head)->next = NULL;
```
```
        }
```
```
        else
```
```
        {
```
```
            temp->next = *head;
```
```
            *head = temp;
```
```
        }
```
```
    }
```
```
}
```
```
 
```
```
int length(struct node *head)
```
```
{
```
```
    int num = 0;
```
```
    while (head != NULL)
```
```
    {
```
```
        num += 1;
```
```
        head = head->next;
```
```
    }
```
```
    return num;
```
```
}
```
```
 
```
```
void delete(struct node **head)
```
```
{
```
```
    struct node *temp;
```
```
    while (*head != NULL)
```
```
    {
```
```
        temp = *head;
```
```
        *head = (*head)->next;
```
```
        free(temp);
```
```
    }
```
```
}
```

$ gcc numbernode.c -o numbernode
$ a.out
The number of nodes are: 10

Sanfoundry Global Education & Learning Series – 1000 C Programs.

Here’s the list of Best Books in C Programming, Data-Structures and Algorithms

If you wish to look at other example programs on Linked List, go to Linked List. If you wish to look at programming examples on all topics, go to C Programming Examples.

« Prev - C Program to Reverse a Stack using Recursion

» Next - C Program to Search an Element in Linked List without using Recursion

Related Posts:

Check Computer Science Books
Apply for Data Structure Internship
Check Data Structure Books
Practice Design & Analysis of Algorithms MCQ
Apply for Computer Science Internship

Recommended Articles: