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…

Engineering

Computer Science

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

New Perspectives on HTML5, CSS3, and JavaScript

6th Edition

ISBN:9781305503922

Author:Patrick M. Carey

Publisher:Patrick M. Carey

Chapter12: Working With Document Nodes And Style Sheets: Creating A Dynamic Document Outline

Section12.1: Visual Overview: Exploring The Node Tree

Problem 2QC

See similar textbooks

Related questions

Q: A deque (pronounced "deck") is an abstract data type that combines what a stack can do and what a…

A: According to the asked question, the solution is given below with a proper explanation.

Q: Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as…

A: I have implemented the code in C++ as per the instructions. The code is as follows:…

Q: The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue),…

A: Answers:- Here's the implementation of the cnPtrQueue member functions:

Q: This programming problem deals with circularly-linked queues (CLQueue). You must implement from…

A: PROGRAM INTRODUCTION: Include the required header files. Declare the required global variables.…

Q: tackQueuePostfix A. Pointer_based queue a. Define the class PoiQueue with no implementation; i.e.…

A: Answer: Here not specify the any programming language so we will given answer in C++ programming.…

Q: USING C++ Find and delete the node with the smallest info in the list. (Delete only the first…

A: ANSWER:-

Q: A LinkNode structure or class which will have two attributes - a data attribute and a pointer…

A: 1.LinkNode.java public class LinkNode { private Toy data=null; private LinkNode next;…

Q: The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue),…

A: C++ is a high-performance, cross-platform programming language that was developed by Bjarne…

Q: the Linked List class: import java.util.NoSuchElementException; // Linked list implementation class…

A: The Java code includes an array-based list implementation (AList) and a driver class (Main) for…

Q: Using C languge, implement programmer defined-data types with linked lists. A set of integers may…

A: Define the function initialize to initialize the set with data 0 and next to NULL. Define the…

Q: C++ program to give implementation of circular linked list for object Student. You should have…

Q: given item. Insert an item in the list. Delete an item from the list. Copy the list. Write the…

A: Circular linked lists are an essential data structure in computer science. In this task, we will…

Q: Java Programming ******* Write a Java application that will, given an appropriate data structure,…

A: Solution:-- 1)The given question has required for the solution with the help of the Java program…

Q: Part-1(Java) Create a doubly linked list based DeQueDLL class that implements the DequeInterface.…

A: Assuming the DLLNode class with given methods (use methods of your implementation of DLLNode…

Q: For example: Programming generates and modifies linked lists: Typically, the software monitors two…

A: In programming, linked lists are commonly used data structures that consist of nodes connected…

Q: In c++ , write a program to create a structure of a node, create a class Linked List. Implement all…

A: #include <iostream>using namespace std; struct Node{int data;Node *next;}; class…

Q: In C++, please write a function that traverse through a linked list to find the node that contains…

A: linked list:- Linked List is a linear data structure, much as arrays. In contrast to arrays, linked…

Q: Write C++ program to give implementation of circular linked list and should have the following…

A: Circular Linked List is a variation of Linked list in which the first element points to the last…

Q: For a sorted Single linked list of Node typed objects, class Node { public: int id; string Name;…

A: #include <iostream> using namespace std; struct Node { int data; Node* next;}; // only for the…

Q: You have been provided with java code for SomeList class. This code is for a general linked list…

A: Linked List is a part of the Collection framework present in java.util package. This class is an…

Q: . Write code to define LinkedQueue and CircularArrayQueue classes which will implement QueueADT…

A: SUMMARY: -Hence, we get the output

Q: A double-ended queue or deque is a generalization of a stack and a queue that supports adding and…

A: Program descriptionThe answer for part-1 cannot be attempted as interface and skeleton has not been…

Q: Consider the implementation of the Ordered Linked list class, implement the following functions as…

A: Solution: Given, index(item) returns the position of item in the list. It needs the item and…

Q: 8. Implement an extractLessThan operation on a singly-linked list with no tail pointer. Your code…

A: #include <iostream>using namespace std; typedef int Data; struct LinkNode{ Data * data;…

Q: Objectives: The code for the different stack and queue operations in both implementations (array…

A: Note: We are authorized to answer one question at a time since you have not mentioned which…

Q: Write java code for a member function insertSorted(int d) for a linked list. The function traverses…

A: here have to determine about java code for add element in sorted way.

Q: Suppose you are tasked with implementing a reverse queue in which elements are enqueued at the front…

A: A reverse queue can also be implemented using two stacks, but in the question it is given to…

Q: C++ program to give implementation of circular linked list for object Student. You should have…

A: Given: C++ program to give implementation of circular linked list for object Student. You should…

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

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

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

#ifndef NODES_LLOLL_H#define NODES_LLOLL_H #include <iostream> // for ostream namespace CS3358_SP2023_A5P2{ // child node struct CNode { int data; CNode* link; }; // parent node struct PNode { CNode* data; PNode* link; }; // toolkit functions for LLoLL based on above node definitions void Destroy_cList(CNode*& cListHead); void Destroy_pList(PNode*& pListHead); void ShowAll_DF(PNode* pListHead, std::ostream& outs); void ShowAll_BF(PNode* pListHead, std::ostream& outs);} #endif #include "nodes_LLoLL.h"#include "cnPtrQueue.h"#include <iostream>using namespace std; namespace CS3358_SP2023_A5P2{ // do breadth-first (level) traversal and print data void ShowAll_BF(PNode* pListHead, ostream& outs) { cnPtrQueue queue; CNode* currentNode; queue.push(pListHead->data); while (!queue.empty()) { currentNode = queue.front(); queue.pop(); if…
An IntNode is a struct defined as: typedef struct IntNode struct { int dataVal; struct IntNode struct* nextNodePtr; } IntNode; Using this linked list diagram: Address of node: 2000 2800 1500 3600 3 65 34 76 head and this code snippet: IntNode * current; current = head; What is the value stored of current->nextNodePtr->nextNodePtr? 3 65 34 76 2000 2800 1500 3600 O O O O O O 0 0
#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{ int data; Node *link;};void DelOddCopEven(Node*& headPtr);int FindListLength(Node* headPtr);bool IsSortedUp(Node* headPtr);void InsertAsHead(Node*& headPtr, int value);void InsertAsTail(Node*& headPtr, int value);void InsertSortedUp(Node*& headPtr, int value);bool DelFirstTargetNode(Node*& headPtr, int target);bool DelNodeBefore1stMatch(Node*& headPtr, int target);void ShowAll(std::ostream& outs, Node* headPtr);void FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif
Computer Science lab3.h ------------- #include<stdio.h> #include<stdlib.h> #ifndef LAB3_H #define LAB3_H // A linked list node struct Node { int data; //Data struct Node *next; // Address to the next node }; //initialize: create an empty head node (whose "data" is intentionally missing); This head node will not be used to store any data; struct Node *init () { //create head node struct Node *head = (struct Node*)malloc(sizeof(struct Node)); } //Create a new node to store data and insert it to the end of current linked list; the head node will still be empty and data in the array in "main.c" are not stored in head node void insert(struct node *head, int data) { struct Node *newNode = (struct Node*)malloc(sizeof(struct Node)); new_node->data = data; new_node->next= head; } //print data for all nodes in the linked list except the head node (which is empty) void display (struct Node *head) { struct Node *current_node = head; while ( current_node != NULL) { printf("%d ",…
#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{ int data; Node *link;}; bool DelOddCopEven(Node* headPtr);int FindListLength(Node* headPtr);bool IsSortedUp(Node* headPtr);void InsertAsHead(Node*& headPtr, int value);void InsertAsTail(Node*& headPtr, int value);void InsertSortedUp(Node*& headPtr, int value);bool DelFirstTargetNode(Node*& headPtr, int target);bool DelNodeBefore1stMatch(Node*& headPtr, int target);void ShowAll(std::ostream& outs, Node* headPtr);void FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif // definition of DelOddCopEven of Assignment 5 Part 1//Algorithm should: /*NOT destroy any of the originally even-valued node. This means that the originally even-valued nodes should be retained as part of the resulting list. Destroy…
Data Structures (Code in Python) Create Node and LinkedList and create a function which can add items (Ice cream, Fried Chicken, etc ) in LinkedList and then create function which can delete items from LinkedList by names
by using the c language program:
In this code: #include <iostream> #include <string> using namespace std;// Node struct to store data for each song in the playliststruct Node { string data; Node * next;};// Function to create a new node and return its addressNode * getNewNode(string song) { Node * newNode = new Node(); newNode -> data = song; newNode -> next = NULL; return newNode;}// Function to insert a new node at the head of the linked listvoid insertAtHead(Node ** head, string song) { Node * newNode = getNewNode(song); if ( * head == NULL) { * head = newNode; return;} newNode -> next = * head; * head = newNode;}// Function to insert a new node at the tail of the linked listvoid insertAtTail(Node ** head, string song) { Node * newNode = getNewNode(song); if ( * head == NULL) { * head = newNode; return; } Node * temp = * head; while (temp -> next != NULL) { temp = temp -> next; } temp -> next = newNode;}// Function to remove a node from the linked listvoid removeNode(Node ** head,…
Tepis Linked List By using stt Usc this declaration of the Node clas3: atzuct Node { ant infoJ Node next Node *p, r, *g: Question 1 nitiol Setup Exercise Final Configuration Use o single cssignment Exomple stotement to make the p=p->next->data, variable p refer to the Node with info 2 Use a single ossignment Code: stotement to cssignment statement must refer to both variables p and q. Use o single Ossignment stotement to make the| Code: variable a refer to the / Node with info T. Use o single ossianment | Code: statement to make the variable r refer to the Node with info 2. Use a single ossignment Code: stotement to set the info referred to by p equal to the info of the Node referred to by ryou must access this info through r; do not refer to the of the Node character '3' directly)
Nodes contain two parts, the first part stores the actual data and the second part has a pointer that points to the next node. * True O False
Assume the pointer variable headPtr points to a linked list of 20 Nades. Explain the logic error that occurs when the following statement is executed: headPtr = new Node; Edit View Insert Format Tools Table 12pt Paragraph BIUA e Tv.
Which node contains a pointer to its parent?a) root nodeb) right most childc) left most childd) left sibling