linear queue using linked list

-

linear queue using linked list

linear queue using linked list linear queue using linked list linear queue using linked list linear queue using linked list linear queue using linked list 
In this representation we  can store unlimited  values in queue because linked list support dynamic memory allocation.In this case the concept of overflow will not be accrued. In underflow condition front and rear will be NULL.

Implementation Queue using linked list




#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<process.h>
struct node
{
    int info;
    struct node *link;
};

 struct node *front=NULL,*rear=NULL;
void insertion();
void deletion();
void display();
 int main()
 {
     int choice;
     do
     {
         system("cls");
         printf("====SELECT YOUR CHOICE=====\n press 1 for insert value-\n press 2 for display the element\n press 3 for delete-----\n  enter choice=");
         scanf("%d",&choice);
         switch(choice)
         {
         case 1:
            insertion(); break;
         case 2:
            display(); break;
         case 3:
            deletion(); break;
         default:
            printf("invalid choice!");

          }
     }
     while(choice>=1||choice<=3);

  }
 void insertion()
 {
     struct node *new1;
     new1=(struct node*)malloc(sizeof(struct node));
     printf("enter the value of node");
     scanf("%d",&new1->info);
     new1->link=NULL;
      if(front==NULL)
      front=rear=new1;
      else{
        rear->link=new1;
        rear=new1;
      }
 }

  void display()
 {
     struct node *temp;
     if(front==NULL)
        printf("queue is underflow");
     else{
        temp=front;
        do
        {
            printf("%d\n",temp->info);
            temp=temp->link;
        }
        while(temp!=NULL);
     }
     system("pause");
 }

  void deletion()
 {
     if(front==NULL)
        printf("queue is underflow");
     else{
            printf("deleted recode=%d",front->info);
        if(front==rear)
            front=rear=NULL;
        else
            front=front->link;
     }
     system("pause");
 }


Comments

Post a Comment

Popular posts from this blog

python pattern programming

-
Image
PYTHON PATTERN PROGRAMMING Python nested loop: Python allow programmer to use nested loops.Nested loop means when one loop is define into another loop is known as nested loop,in which one is called inner loop and another is called outer loop.In which when outer loop's condition is true than inner loop will be execute. we use the concept of nested loop in pattern programming etc. syntax: while (condition):      while (condition):         statement x     statement y   Some examples of nested loop. Nested loop program. Q. write  a program to print following pattern. P P Y P Y T P Y T H P Y T H O P Y T H O N str = "PYTHON" for  i  in   range ( 0 , 6 ):      print ()      for  j  in   range ( 0 ,i+ 1 ):      ...
Read more

Decision making statement in python

-
Image
Decision making statement in python In this statement we can take a decision for executing block of statement.if in this case condition is checked.if condition is true then the true part will execute,otherwise false part will execute.        There are four types of decision making statement. (1) simple if statement/single alternative if statement. (2) if-else statement/double alternative if statement. (3) if-else-if statement/else if ladder statement. (4) Nested if statement/compound if statement. (1)simple if statement/single alternative if statement  In this statement if condition is true then true part will execute otherwise no action will generate.  Syntax: if  test expression:     Statement 1     Statement 2     Statement 3    ---------------    ---------------     Statement n Statement x Examples: if  ( age>=18) :    print( "You are elig...
Read more

Recursive function

-
Image
What  is recursive function ? A recursive function is the function that calls itself during execution of program. Every recursive solution has two major cases, which are fallows: Base case , in which the problem is simple enough to solve directly without making any further calls to the same function. Recursive case , in which first the problem at hand divided into simpler sub-part. Second, the function calls itself but sub-parts of the problem obtained in the first stem. Third, the result is obtained by combining the solutions of simpler sub- part. Thus we see that recursion utilized divide and conquer technique of problem solving.  Divide and conquer technique is a method of solving a given problem by dividing it into two or more smaller instances. Now for understand the recursive function let us see an example of calculating factorial of a number. The factorial of a number id n!= n x (n-1)! Now , 5!= 5 x 4 x 3 x 2 x1     =120 This can be written as: 5!= 5 x...
Read more