Code CrazeMar 9, 20231 min readLinked List Insertion At End#include <stdio.h>struct node{ int data; struct node *next;};struct node *head,*newnode;int choice;void main() { printf("\n----Insertion At End----"); struct node *temp; do { newnode = (struct node *)malloc(sizeof(struct node)); printf("\nEnter data : "); scanf("%d", &newnode->data); newnode->next=0; if(head==0) { head=temp=newnode; } else{ temp=head; while(temp->next!=0) { temp=temp->next; } temp->next=newnode; } printf("\nEnter your choice : (0/1) "); scanf("%d", &choice); }while(choice); temp=head; printf("\n"); while(temp!=0) { printf("--%d", temp->data); temp=temp->next; }}
#include <stdio.h>struct node{ int data; struct node *next;};struct node *head,*newnode;int choice;void main() { printf("\n----Insertion At End----"); struct node *temp; do { newnode = (struct node *)malloc(sizeof(struct node)); printf("\nEnter data : "); scanf("%d", &newnode->data); newnode->next=0; if(head==0) { head=temp=newnode; } else{ temp=head; while(temp->next!=0) { temp=temp->next; } temp->next=newnode; } printf("\nEnter your choice : (0/1) "); scanf("%d", &choice); }while(choice); temp=head; printf("\n"); while(temp!=0) { printf("--%d", temp->data); temp=temp->next; }}
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 operations. When an element is pushed onto the stack, it is enqueued