Answered You can buy a ready-made answer or pick a professional tutor to order an original one.
I need help completing this program.
Write a C++ program to implement a queue using linked lists. The program should provide the following functionality:
- Enqueue data into queue
- Dequeue data from queue
- Print data at the front
- Print data at the back
- Print the entire queue
- Check if the queue is empty
- Print the number of elements in the queue
Test your program using at least the following test cases (considering the queue includes integers):
- Check if the queue is empty: Option F.
- Enqueue 7 into the queue: Option A.
- Enqueue 4 into the queue: Option A.
- Check if the queue is empty: Option F.
- Dequeue data form the queue.
- Print the number of elements in the queue: Option G.
- Enqueue 5 into the queue: Option A.
- Print the number of elements in the queue: Option G.
- Check if the queue is empty: Option F.
- Print data at the front: Option C.
- Print data at the back: Option D.
- Print entire queue: Option E.
- @
- 22 orders completed
- ANSWER
-
Tutor has posted answer for $35.00. See answer's preview
*** the **** ** **** ** ********** ** ******* ******* me know ** * **** *** further ************** is the ********************************************************* ********* std;struct node{int info;struct node *next;};class ****************** ********** ********** ************************* enqueue();void ************** display();void isEmpty();void *************** dataFront();void ************************************ * NULL;front * ********** ******** Queue::dataFront(){if (front == **** ***************** **** in ***** ** ***** ** ************************************************************ ******************** ***** ** **** ***************** **** ** **** ** queue ** empty\n";}else{cout<<rear->info<<"\n";}}void ************************ * ***** **** ******************** are *********************** ******** ** *** ******************************************* *** ** ******** ** the *************** ******************** data;node ***** = *** *********************** the **** ** ******** ";cin>>data;temp->info = ****************** * ************* == **** && rear == NULL){front = **** = ******************* = ********* * temp;count++;}void Queue::dequeue(){node ***** * *** ************* ** NULL){cout<<"\nQueue ** Emtpty\n";}else{cout<<"Data ** "<< ********************** ******* ****** ** ***** ****** * **** * **************** = ****************************** **************** {if(front ** ************************** ** ************************************ ** *** empty\n";}}void ********************* ** * *** node;p * front;if(front ** NULL){cout<<"\nNothing ** ******************************************************************** = ***************** ************ ********** ********************************************* ********** Print ***** data\nD ***** **** ******* ***** Entire ******** ***** if ***** is ******** ** of elements ** queue\nH Quit;";cout<<"\nEnter **** ******* *************************************** ***************************** ***************************** ******************************** ******************************* 'E':queuedisplay();break;case 'F':queueisEmpty();break;case *********************************** ************************************************ ***** *** ****** ****************** ***
