Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
What would be missing code Remaining part(not in picture ) BeeNode* headObj = nullptr; BeeNode* firstBee = nullptr; BeeNode* secondBee = nullptr; BeeNode* currBee = nullptr; int babies1; int babies2; cin >> babies1; cin >> babies2; headObj = new BeeNode(-1); /* Your code goes here */ currBee = headObj; while (currBee != nullptr) { currBee->PrintNodeData(); currBee = currBee->GetNext(); } return 0; }

What would be missing code Remaining part(not in picture ) BeeNode* headObj = nullptr; BeeNode* firstBee = nullptr; BeeNode* secondBee = nullptr; BeeNode* currBee = nullptr; int babies1; int babies2; cin >> babies1; cin >> babies2; headObj = new BeeNode(-1); /* Your code goes here */ currBee = headObj; while (currBee != nullptr) { currBee->PrintNodeData(); currBee = currBee->GetNext(); } return 0; }

Database System Concepts
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
icon
Related questions
Question
What would be missing code Remaining part(not in picture ) BeeNode* headObj = nullptr; BeeNode* firstBee = nullptr; BeeNode* secondBee = nullptr; BeeNode* currBee = nullptr; int babies1; int babies2; cin >> babies1; cin >> babies2; headObj = new BeeNode(-1); /* Your code goes here */ currBee = headObj; while (currBee != nullptr) { currBee->PrintNodeData(); currBee = currBee->GetNext(); } return 0; }
Two integers, babies1 and babies2, are read from input as the number of babies of two bees. headObj has the default value of -1. Create a new node firstBee with integer babies1 and insert firstBee after headObj. Then, create a second node secondBee with integer babies2 and insert second Bee after firstBee. Ex: If the input is 37 61, then the output is: -1 37 61 1 #include <iostream> 2 using namespace std; 4 class BeeNode { 5 public: 6 BeeNode (int babiesInit = 0, BeeNode* nextLoc= nullptr); void InsertAfter (BeeNode* nodeLoc); 7 8 9 10 11 12 13 }; 14 BeeNode GetNext(); void PrintNodeData(); private: Check int babiesVal; BeeNode* nextNodePtr; 15 BeeNode::BeeNode (int babies Init, BeeNode* nextLoc) '{ 16 this->babiesVal= babies Init; this->nextNodePtr = nextLoc; 17 18} CS Scanned with CamScanner Next level 3
Transcribed Image Text:Two integers, babies1 and babies2, are read from input as the number of babies of two bees. headObj has the default value of -1. Create a new node firstBee with integer babies1 and insert firstBee after headObj. Then, create a second node secondBee with integer babies2 and insert second Bee after firstBee. Ex: If the input is 37 61, then the output is: -1 37 61 1 #include <iostream> 2 using namespace std; 4 class BeeNode { 5 public: 6 BeeNode (int babiesInit = 0, BeeNode* nextLoc= nullptr); void InsertAfter (BeeNode* nodeLoc); 7 8 9 10 11 12 13 }; 14 BeeNode GetNext(); void PrintNodeData(); private: Check int babiesVal; BeeNode* nextNodePtr; 15 BeeNode::BeeNode (int babies Init, BeeNode* nextLoc) '{ 16 this->babiesVal= babies Init; this->nextNodePtr = nextLoc; 17 18} CS Scanned with CamScanner Next level 3
CS Two integers, babies1 and babies2, are read from input as the number of babies of two bees. headObj has the default value of -1. Create a new node firstBee with integer babies1 and insert firstBee after headObj. Then, create a second node secondBee with integer babies2 and insert second Bee after firstBee. Ex: If the input is 37 61, then the output is: -1 37 61 19 20 void BeeNode:: InsertAfter (BeeNode* nodeLoc) { 21 BeeNode* tmpNext = nullptr; 22 23 24 25 nodeLoc->nextNodePtr = tmpNext; tmpNext this->nextNodePtr; this->nextNodePtr = nodeLoc; 26} 27 28 BeeNode* BeeNode::GetNext() { 29 return this->nextNodePtr; 30 } 31 32 void BeeNode::PrintNodeData() { 33 cout << this->babiesVal << endl; 34} 35 36 int main() { 37 BeeNode headObj = nullptr; 1 Scanned wi 2 lanner. 'L 3
Transcribed Image Text:CS Two integers, babies1 and babies2, are read from input as the number of babies of two bees. headObj has the default value of -1. Create a new node firstBee with integer babies1 and insert firstBee after headObj. Then, create a second node secondBee with integer babies2 and insert second Bee after firstBee. Ex: If the input is 37 61, then the output is: -1 37 61 19 20 void BeeNode:: InsertAfter (BeeNode* nodeLoc) { 21 BeeNode* tmpNext = nullptr; 22 23 24 25 nodeLoc->nextNodePtr = tmpNext; tmpNext this->nextNodePtr; this->nextNodePtr = nodeLoc; 26} 27 28 BeeNode* BeeNode::GetNext() { 29 return this->nextNodePtr; 30 } 31 32 void BeeNode::PrintNodeData() { 33 cout << this->babiesVal << endl; 34} 35 36 int main() { 37 BeeNode headObj = nullptr; 1 Scanned wi 2 lanner. 'L 3
Expert Solution
steps

Step by step

Solved in 5 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
User Defined DataType
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
SEE MORE TEXTBOOKS