top of page

Length of a Linked List




#include <stdio.h>

struct node{

int data;

struct node *next;

};


struct node *head,*newnode;

int choice;

int length=0;


void main() {

printf("\n----Insertion At Beginning----");

struct node *temp;

do

{

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

printf("\nEnter data : ");

scanf("%d",&newnode->data);

newnode->next=head;

head=newnode;

printf("\nEnter your choice : (0/1) ");

scanf("%d",&choice);

}while(choice);

temp=head;

printf("\n\n");

while(temp!=0)

{

printf("--%d",temp->data);

temp=temp->next;

length++;

}

printf("\n\nLength of linked list : %d",length);

}

2 views0 comments

Recent Posts

See All

Stack Using Queue

A stack can be implemented using two queues in C. The basic idea is to use one queue for enqueue operations and another for dequeue operations. When an element is pushed onto the stack, it is enqueued

bottom of page