Length of a Linked ListCode CrazeMar 10, 20231 min read#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); }
#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); }
Stack Using QueueA stack can be implemented using two queues in C. The basic idea is to use one queue for enqueue operations and another for dequeue...
Comments