4) Consider the following Queue class that uses linked list to constract a Queae class Node; typedef Node NodePtr; class Node public: int number; NodePtr next; Node({number =0; next NULL;} Node(int n){number=n; next-NULL;} 11- class Queue private: NodePtr top; int currSize; const int fullSize; public: I/ initializes the Queue to an empty Queue (fixed size of 5) Queue () fullSize = 5; currsize =0; top = NULL; I/ initializes the Queue to an empty Queue and specific maximum size Queue (int maxSize) fullSize = maxSize; currsize =0; top NULL; Palke? int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist bool empty0; bool full(); Il checks if the Queue is empty Il checks if the Queue is full Note: Please answer the question on the next page

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please help with the follow question in C++

4) Consider the following Queue class that uses linked list to constract a Queae
class Node;
typedef Node NodePtr;
class Node
public:
int number;
NodePtr next;
Node({number =0; next NULL;}
Node(int n){number=n; next-NULL;}
11-
class Queue
private:
NodePtr top;
int currSize;
const int fullSize;
public:
I/ initializes the Queue to an empty Queue (fixed size of 5)
Queue ()
fullSize = 5;
currsize =0;
top = NULL;
I/ initializes the Queue to an empty Queue and specific maximum size
Queue (int maxSize)
fullSize = maxSize;
currsize =0;
top NULL;
Palke?
int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal
int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist
bool empty0;
bool full();
Il checks if the Queue is empty
Il checks if the Queue is full
Note: Please answer the question on the next page
Transcribed Image Text:4) Consider the following Queue class that uses linked list to constract a Queae class Node; typedef Node NodePtr; class Node public: int number; NodePtr next; Node({number =0; next NULL;} Node(int n){number=n; next-NULL;} 11- class Queue private: NodePtr top; int currSize; const int fullSize; public: I/ initializes the Queue to an empty Queue (fixed size of 5) Queue () fullSize = 5; currsize =0; top = NULL; I/ initializes the Queue to an empty Queue and specific maximum size Queue (int maxSize) fullSize = maxSize; currsize =0; top NULL; Palke? int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist bool empty0; bool full(); Il checks if the Queue is empty Il checks if the Queue is full Note: Please answer the question on the next page
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
ADT and Class
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education