C++ Queue LinkedList, Refer to the codes I've made as a guide and add functions where it can add/insert/remove function to get the output of the program, refer to the image as an example of input & output. Put a comment or explain how the program works/flow. ***Queue Linked List Implementation***What do you want to do?Enter letter of choice: cQueue:NULLa. Inqueue item into the Queueb. Dequeue item out of the Queuec. Display QueueRun program again? Press y if yes: yWhat do you want to do?Enter letter of choice: bYou can't dequeue from an empty QueueRun program again? Press y if yes: yWhat do you want to do?Queue:0a. Inqueue item into the Queueb. Dequeue item out of the Queuec. Display QueueEnter letter of choice: aEnter the item to the queue: 0Queue:0 1a. Inqueue item into the Queueb. Dequeue item out of the Queuec. Display QueueEnqueue more item? Press if yes: yEnter item to the queue: YEnqueue more item? PressEnter item to the queue:Queue:012Enqueue more item? PressEnter item to the queue: žQueue:0 1 2 3Enqueue more item? Press y if yes: nEnding Enqueue function...if yes: yRun program again? Press y if yes: yWhat do you want to do?Enter letter of choice: cQueue:0 1 2 3if yes: yQueue:1 2 3Run program again? Press y if yes: yWhat dowant to do?Dequeue more items? Press y if yes: yHow many items to be dequeued off the Queue? 2Queue:3a. Inqueue item into the Queueb. Dequeue item out of the Queuec. Display QueueDequeue more items? Press y if yes: yHow many items to be dequeued off the Queue? 2You can't dequeue from an empty Queuea. Inqueue item into the Queueb. Dequeue item out of the Queuec. Display QueueEnter letter of choice: bHow many items to be dequeued off the Queue? 1 1 #include 2using namespace std;34 class Node58{6781516171819 };20910};11 class Linked List public Node12 {13public:14212223HH H242526272829303132333435{}Node::Node()//ctor{public:}LinkedList::LinkedList(){Node();int value;Node" next;}void LinkedList::printLinked List (Node* n)4748LinkedList();49void printLinked List (Node* n);50void insertAtTheFront (Node** head, int newValue); 51void insertAtThe End (Node** head, int newValue);void insertAfter (Node* previous, int newValue);5253545556575859//ctor{while(n!=NULL)}3637383940414243444546cout << n->value << endl;n=n->next;606162636465666768697071void LinkedList::insertAtTheFront (Node** head, int newValue){Node newNode = new Node();newNode->value=newValue;newNode->next="head;*head=newNode;}void LinkedList::insertAt The End (Node** head, int newValue){Node* newNode= new Node();newNode->value = newValue;newNode->next = NULL;if (*head = NULL){*head=newNode;}Node" last=*head;while(last->next!=NULL)last-last->next;{}return;last->next=newNode;}void LinkedList::insertAfter (Node* previous, int newValue){if(previous ==NULL){cout << "Previous node cannot be NULL.";return;}Node* newNode = new Node();newNode->value=newValue;newNode->next-previous->next;previous->next=newNode;73 int main()74 {75767778798081828384858687888990919293}Node head = new Node();Node* second = new Node();Node* third new Node();head->value=1;head->next=second;second->value=2;second->next=third;third->value=4;third->next=NULL;LinkedList 11;11.insertAtTheFront (&head, -1);11.insertAtThe End (&head, 5);11.insertAfter (head, 0);11.insertAfter (second, 3);11.printLinkedList (head);return 0;

Given :- In the above question, the statement is mention in the above given question Need to put a…

Answered: C++ Queue LinkedList

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

C++ Queue LinkedList, Refer to the codes I've made as a guide and add functions where it can add/insert/remove function to get the output of the program, refer to the image as an example of input & output. Put a comment or explain how the program works/flow.