Find the Length of the Linked List without using Recursion
#include
#include
#include
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;
clrscr();
generate(&head);
count = length(head);
printf("The number of nodes are: %d\n", count);
delete(&head);
return 0;
}
void generate(struct node **head)
{
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);
}
}
Output
The number of nodes are: 10
No comments:
Post a Comment