Question

In c++ language

Design and implement a Queue data structure using linked list. Support the following usual operations: default constructor parameterized constructor to create a queue of user-specified capacity enqueue dequeue is_full is_empty display destructor that deallocates all the nodes copy constructor overloaded assignment operator Demonstrate using a main function.

Answer 1

#ifndef COD E137 QUEUE H #define CODE137 QUEUE H #include <iostream> using namespace std; struct QNode char ch; QNode "next; class Code137_Queue private: QNode "head, "tail Pointers to head and tail of the queue public: Code137 Queue Class constructor Code137 Queue( void ClearQueueRemove all items from the queue bool Enqueue(char chl; //Enter an item in the queue char Dequeue(; bool isEmpty(; bool isFullC void display( /Class destuctor // Remove an item from the queue // Return true if queue is empty // Return true if queue is full );#endif #include "Code137Queue,h" Code137 Queue: Code137 Queuel - head tail = NULL; Code137 Queue. Code137 Queue ClearQueue

void Code137 Queue::ClearQueue QNode "temp; while(head != NULL) temp head; head = head-> next; delete temp; head = ta.: NULL; // Reset indices to start over bool Code137_Queue: Enqueue(char ch) QNode "temp; //Check to see if the Queue is full ifisFull) return false; //Create new node for the queue temp new QNode ( temp->ch - ch; temp-> next NULL; //Check for inserting first in the queue if(head NULL) head- tail temp; else tail->next - temp; // Insert into the queue tail = temp; Set tail to new last node return true char Code137_Queue: Dequeuel

char ch QNode "temp; //Check for empty Queue iffisEmpty) return 10; //Return null character if queue is empty else ch head->ch; // Get character to return temp head; head head->next; I/ Advance head pointer delete temp; //Check to see if queue is empty if isEmpty() // Free old head head = tai. NULL; // Reset everything to empty queue return ch; /Return popped character bool Code137_Queue::isEmpty( return (head == NULL); bool Code137 Queue::isFull return false Main file used to test the queue #include "code137 Queue"h" #include <string.h> int main(int argc, char "argv

testString[27 char int char Code137_uue Q cout<<"Simple Queue Demonstration\n"; cout<<"(Queue implemented as an Array Queue data type is character.\n\n"; cout<<"Creating a queuen"; Q= new Code137-Queue(); cout <<"Queue created...n" Test enqueuing and dequing item on a queue cout <<Testing enqueue and dequeue of single item.\n"; Q Enqueue('A' cout << "Enqueued: " << -> Dequeue() <<ヘn", cout << "...donen\n"; // Test queue by enqueing letters in a string strcpy(testString, "abcdefghijklmnopqrasuvwxyz"; //Try to Enqueue al letters in the string cout <<Testing enqueuing of string: "<<testString<n" while(testString[i]-10') if !Q->Enqueue(testStringlil cout <"Queue is full. Unable to enqueue "<testStringlil cout << nnIn Done testing enqueue.\n\nNow testing dequeue.\n"; //Dequeue letters and print them

cout <<"Dequeued letters are...\n"; while((chQ>Dequeue() /Dequeue returns null terminator cout < ch; // when queue is empty cout << 'in End of queue encountered·An"; cout << "in In done. In"; return 0; void Queue:display node *p new node; p front; ifffront NULLH cout«ぐ Nothing to Display\n"; elsel while(p!-NULL cout« end!<< p-> info; p = p-> next;