Nov
28
2008

C++ Program to implement a QUEUE using linked list

C++ Program to implement a QUEUE using linked list.

/**************************************************************	
	Author: Arun Vishnu M V
	Web: www.arunmvishnu.com
	Description: C++ Program to implement a QUEUE using linked list.
***************************************************************/
#include<conio.h>   	
#include<iostream.h> 
#include<process.h>  
#include<malloc.h>  
 
//   Creating a NODE Structure
struct node
{
   int data;
   struct node *next;
};
 
// Creating a class QUEUE
class queue
{
   struct node *frnt,*rear;
   public:
      queue() // constructure
      {
	 frnt=rear=NULL;
      }
      void insert(); // to insert an element
      void del();  // to delete an element
      void show(); // to show the stack
};
// Insertion
void queue::insert()
{
   int value;
   struct node *ptr;
   cout<<"\nInsertion\n";
   cout<<"Enter a number to insert: ";
   cin>>value;
   ptr=new node;
   ptr->data=value;
   ptr->next=NULL;
   if(frnt==NULL)
      frnt=ptr;
   else
      rear->next=ptr;
   rear=ptr;
   cout<<"\nNew item is inserted to the Queue!!!";
   getch();
}
 
// Deletion
void queue::del()
{
   if(frnt==NULL)
   {
      cout<<"\nQueue is empty!!";
      getch();
      return;
   }
   struct node *temp;
   temp=frnt;
   frnt=frnt->next;
   cout<<"\nDeletion Operation........\nDeleted value is "<<temp->data;
   delete temp;
   getch();
}
 
// Show Queue
void queue::show()
{
   struct node *ptr1=frnt;
   if(frnt==NULL)
   {
      cout<<"The Queue is empty!!";
      getch();
      return;
   }
   cout<<"\nThe Queue is\n";
   while(ptr1!=NULL)
   {
      cout<<ptr1->data<<" ->";
      ptr1=ptr1->next;
   }
   cout<<"END";
   getch();
}
 
// Main function
int main()
{
   clrscr();
   queue q;
   int choice;
   while(1)
   {
      cout<<"\n-----------------------------------------------------------";
      cout<<"\n\t\tQUEUE USING LINKED LIST\n\n";
      cout<<"1:INSERTION\n2:DELETION\n3:DISPLAY QUEUE\n4:EXIT";
      cout<<"\nEnter your choice(1-4): ";
      cin>>choice;
      switch(choice)
      {
       case 1:
	  q.insert();
	  break;
       case 2:
	  q.del();
	  break;
       case 3:
	  q.show();
	  break;
       case 4:
	  exit(0);
	  break;
       default:
	  cout<<"Please enter correct choice(1-4)!!";
	  getch();
	  break;
       }
   }
   return 0;
}
 
//---------------------- END--------------------

Related Posts

Author: Arun Vishnu

16 Comments + Add Comment

  • The best code.
    It compiled without any bug

  • Been searching for one of these for a while and this IS the best one.

  • HELLO SIR.THIS IS THARUN.
    SIR I WANT TO KNOW MORE PROGRAMMES ON C .CAN U PLEASE SEND ME UR PERSONNAL WEBSITE ADDRESS PLEASE.

  • thank a loooooooooooooooooooooot. my practs start form 1st and it was helpful to find an error free program…

  • Once u make a sample program can u please make it in a simple and short.
    Thank’s..

  • thank u so much for this program. i am really impressed for this program..

  • well, its gud code

  • literally a life saver, keep posting such a nice literatures. Thanks :-)

  • Thanks.. It has help me… Thank you very much..

  • seriously the best code for linked list …..really helped me

  • awsome work dude,really helped me a lot.

  • I have a number of PDF files e.g. ~100 x PDF’ that are named 1) Part1_A5Flyer.pdf, 2) Part2_A5Flyer.pdf… #) Part10_A5Flyer.pdf, Part11_A5Flyer.pdf,..Part100_A5Flyer.pdf.

    I would like to place the small PDF files in an ordered queue based on their file-name i.e. doc1.pdf thru doc100.pdf checking to ensure the 100 or so PDFs files are in name order,. I would like the choice of writing the ordered queue direct to print processing or to a folder which can be be later accessed for print production. Also I would like to set a delay of around 2 to 5 seconds between writing the successive top of queue items (PDF duplex page pairs) such that our print processing ,that is very fast has a chance to deal with the next top of queue PDF in name order. I can send say a handful of PDF files if this is helpful. , Not having written C for a long time what compiler IDE do you recommended

    Thanks for your help!
    End.

    I jsb i would like both to be ble to write the ordered data than comes out of the queses either to a folder or direct to the PDF print-n

  • pls help me

  • increadible….

  • Thanks a lot.will u please give code for linked representation of binary tree?

  • It started with i – Phone and it has now moved to i – Pad 2; the reason- deficiency of availability.

    s no secret that illegal file sharing is still rampant in several countries, such as US, however,
    may possibly not be government interference that eventually leads for the end with the age of illegal downloads.
    Trading invites a number of sites is very frowned upon inside the exclusive Bit – Torrent community mainly because it allows anti-piracy groups to infiltrate private
    trackers with less effort.

Leave a comment

Archives

Highslide for Wordpress Plugin