Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

queue class program that uses in put output file c++ langauge(not linked lisr im

ID: 3570839 • Letter: Q

Question

queue class program that uses in put output file c++ langauge(not linked lisr implementation)

-fill the que with elements from an input file

-function that prints the elements of a queue

-a function that will create a new que composed of values that are less than the values in the origninal queue

Please show output

Explanation / Answer

#include template class Node { friend LinkedQueue; private: T data; Node *link; }; template class LinkedQueue { public: LinkedQueue() {front = rear = 0;} // constructor ~LinkedQueue(); // destructor int IsEmpty() const {return ((front) ? 0 : 1);} T First() const; // return first element T Last() const; // return last element LinkedQueue& Add(const T& x); LinkedQueue& Delete(T& x); private: Node *front; // pointer to first node Node *rear; // pointer to last node }; template LinkedQueue::~LinkedQueue() {// Queue destructor. Delete all nodes. Node *next; while (front) { next = front->link; delete front; front = next; } } template T LinkedQueue::First() const { if (IsEmpty()) { coutlink = 0; if (front) rear->link = p; // queue not empty else front = p; // queue empty rear = p; return *this; } template LinkedQueue& LinkedQueue::Delete(T& x) { if (IsEmpty()) { coutlink; delete p; return *this; } void main(void) { LinkedQueue Q; int x; Q.Add(1).Add(2).Add(3).Add(4); cout