The program reads the first input as the number of integer input values that follow, and then reads and stores that many following input values into myBears. Complete the BearsList class destructor. The destructor prints "In BearsList destructor", followed by a new line, and then calls the destructor of each node in the linked list. Ex: If the input is 2 4 7, then the output is: In BearsList destructor Deallocating BearNode (7) Deallocating BearNode (4) - 1 #include 2 using namespace std; class BearNode { public: 4 5 6 7 8 9 BearNode (int cubsValue); -BearNode(); int cubs; BearNode* next; 10 11 }; 12 13 BearNode::Bear Node (int cubsValue) { 14 cubs cubsValue; 15} 16 17 BearNode::-BearNode() { 18 cout << "Deallocating BearNode (" << cubs << ")" << endl; Scanner CS Scannen 1 2

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
What would be the missing line of code Remaining code that not in pic void BearsList::Prepend(int cubsValue) { BearNode* newNode = new BearNode(cubsValue); newNode->next = head; head = newNode; } int main() { BearsList* myBears = new BearsList(); int inputValue; int bearCount; int i; cin >> bearCount; for (i = 0; i < bearCount; i++) { cin >> inputValue; myBears->Prepend(inputValue); } delete myBears; return 0; }
The program reads the first input as the number of integer input values that follow, and then reads and stores that many following
input values into myBears. Complete the BearsList class destructor. The destructor prints "In BearsList destructor", followed by a
new line, and then calls the destructor of each node in the linked list.
Ex: If the input is 2 47, then the output is:
In BearsList destructor
Deallocating BearNode (7)
Deallocating BearNode (4) -
1 #include <iostream>
2 using namespace std;
3
4
5
6
7
8
9
10
11 };
12
class Bear Node {
public:
BearNode (int cubsValue);
-BearNode();
int cubs;
BearNode* next;
13 BearNode::BearNode (int cubsValue) {
14
15}
16
17 BearNode::-BearNode () {
18
cubs cubsValue;
cout << "Deallocating Bear Node ("<< cubs << ")" << endl;
Scanner
CS Scanner
1
2
Transcribed Image Text:The program reads the first input as the number of integer input values that follow, and then reads and stores that many following input values into myBears. Complete the BearsList class destructor. The destructor prints "In BearsList destructor", followed by a new line, and then calls the destructor of each node in the linked list. Ex: If the input is 2 47, then the output is: In BearsList destructor Deallocating BearNode (7) Deallocating BearNode (4) - 1 #include <iostream> 2 using namespace std; 3 4 5 6 7 8 9 10 11 }; 12 class Bear Node { public: BearNode (int cubsValue); -BearNode(); int cubs; BearNode* next; 13 BearNode::BearNode (int cubsValue) { 14 15} 16 17 BearNode::-BearNode () { 18 cubs cubsValue; cout << "Deallocating Bear Node ("<< cubs << ")" << endl; Scanner CS Scanner 1 2
The program reads the first input as the number of integer input values that follow, and then reads and stores that many following
input values into myBears. Complete the BearsList class destructor. The destructor prints "In BearsList destructor", followed by a
new line, and then calls the destructor of each node in the linked list.
Ex: If the input is 2 47, then the output is:
In BearsList
destructor
Deallocating BearNode (7)
Deallocating BearNode (4)
19}
20
21 class BearsList {
22
23
24
public:
BearsList();
-BearsList();
25
26
27
28 };
29
30 BearsList:: BearsList() {
31
head = nullptr;
void Prepend(int cubsValue);
Check
private:
BearNode head;
32 }
33
34 * Your code goes here
35
36 void BearsList::Prepend(int cubsValue) {
37
BearNode* newNode = new RearNode (cubsValue):
CS Scanned with CamScanner
Next level
Transcribed Image Text:The program reads the first input as the number of integer input values that follow, and then reads and stores that many following input values into myBears. Complete the BearsList class destructor. The destructor prints "In BearsList destructor", followed by a new line, and then calls the destructor of each node in the linked list. Ex: If the input is 2 47, then the output is: In BearsList destructor Deallocating BearNode (7) Deallocating BearNode (4) 19} 20 21 class BearsList { 22 23 24 public: BearsList(); -BearsList(); 25 26 27 28 }; 29 30 BearsList:: BearsList() { 31 head = nullptr; void Prepend(int cubsValue); Check private: BearNode head; 32 } 33 34 * Your code goes here 35 36 void BearsList::Prepend(int cubsValue) { 37 BearNode* newNode = new RearNode (cubsValue): CS Scanned with CamScanner Next level
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Threads in linked list
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