Use the STL stack template class to develop a custom queue class (named cnPtrQueue). ○The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue). ●Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure.Fill in the "holes" intentionally left: ►Function body of ShowAll_BF in nodes_LLoLL.cpp. ○You are to put the cnPtrQueue (NOT the STL queue) to use here. HNm tin và A00 ơi H2456 namespace CS3358_FA2022_A5P27 {8910HANGGANAN111213141516171819202122232425#ifndef NODES_LLOLL_H#define NODES LLOLL_H#include 26272829}// child nodestruct (Nodeint data;CNode* link;};// parent nodestruct PNode{#endif// for ostreamCNode* data;PNode* link;};// toolkit functions for LLOLL based on above node definitionsvoid Destroy_cList (CNode*& cListHead);void Destroy_pList (PNode*& pListHead);void ShowA11_DF (PNode* pListHead, std::ostream& outs);void ShowA11_BF (PNode* pListHead, std::ostream& outs); 1 #include "nodes LLOLL.h".2 #include "cnPtrQueue.h"3 #include 4using namespace std;56 namespace CS3358_FA2022_A5P27891011121314 F15161718192021222324252627282930{// do breadth-first (level) traversal and print datavoid ShowA11_BF (PNode* pListHead, ostream& outs){// to be implemented (part of assignment)// (put at near top to facilitate printing and grading)}void Destroy_cList (CNode*& cListHead){int count = 0;CNode* cNodePtr = cListHead;while (cListHead != 0){cListHead = cListHead->link;delete cNodePtr;cNodePtr = cListHead;++count;}cout << "Dynamic memory for " << count << " CNodes freed"<< endl;

1.STL STACK For creating a stack we must include<stack> Reader file in the code Template…

Answered: Use the STL stack template class to…

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

See similar textbooks

Related questions

Question

Use the STL stack template class to develop a custom queue class (named cnPtrQueue).

○

The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue).

●

Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure.

Fill in the "holes" intentionally left:

►

Function body of ShowAll_BF in nodes_LLoLL.cpp.

○

You are to put the cnPtrQueue (NOT the STL queue) to use here.

HNm tin và A00 ơi H
2
4
5
6 namespace CS3358_FA2022_A5P2
7 {
8
9
10
HANGGANAN
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#ifndef NODES_LLOLL_H
#define NODES LLOLL_H
#include <iostream>
26
27
28
29
}
// child node
struct (Node
int data;
CNode* link;
};
// parent node
struct PNode
{
#endif
// for ostream
CNode* data;
PNode* link;
};
// toolkit functions for LLOLL based on above node definitions
void Destroy_cList (CNode*& cListHead);
void Destroy_pList (PNode*& pListHead);
void ShowA11_DF (PNode* pListHead, std::ostream& outs);
void ShowA11_BF (PNode* pListHead, std::ostream& outs);

1 #include "nodes LLOLL.h".
2 #include "cnPtrQueue.h"
3 #include <iostream>
4
using namespace std;
5
6 namespace CS3358_FA2022_A5P2
7
8
9
10
11
12
13
14 F
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
{
// do breadth-first (level) traversal and print data
void ShowA11_BF (PNode* pListHead, ostream& outs)
{
// to be implemented (part of assignment)
// (put at near top to facilitate printing and grading)
}
void Destroy_cList (CNode*& cListHead)
{
int count = 0;
CNode* cNodePtr = cListHead;
while (cListHead != 0)
{
cListHead = cListHead->link;
delete cNodePtr;
cNodePtr = cListHead;
++count;
}
cout << "Dynamic memory for " << count << " CNodes freed"
<< endl;

Expert Solution

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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