ALL basic on c programings

#include<stdio.h> #define sz 5 int rear=-1; int front =-1; int cqueue[sz]; int i; void insert(int ele) {     if((front==rear+1)||(rear==sz))     {         printf("queue ids full\n");     }else if(front==-1&&rear==-1)     {         front=rear=0;         cqueue[rear]=ele;     }     else if(rear==sz-1)     {       printf("ok");         rear=0;         cqueue[rear]=ele;         }     else     {         rear++;         cqueue[rear]=ele;     } } void delte() {     if(front==-1&&rear==-1)     {       ...

   Single listed list appened ,atbegin,delete,insert middle #include<stdio.h> #include<stdlib.h> struct node {     int data;     struct node* link; }; struct  node* root=NULL; void appened() {     struct node* temp;     temp=(struct node*)malloc(sizeof(struct node));         printf("enter node data\n");         printf("temp add %p\n",temp);         scanf("%d",&temp->data);         temp->link=NULL;     if(root==NULL)     {         printf("node create");         printf("temp add %p\n",temp);         root=temp;     }         else     {         struct node* p; ...