Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Integer frogCount is read from input as the number of input values that follow. The node headFrog is created with the value of frogCount. Use

Integer frogCount is read from input as the number of input values that follow. The node headFrog is created with the value of frogCount. Use cin to read frogCount integers. Insert a FrogNode for each integer at the end of the linked list.

Ex: If the input is 3 10 79 18, then the output is:

3 10 79 18

#include using namespace std; class FrogNode { public: FrogNode(int tadpolesInit = 0, FrogNode* nextLoc = nullptr); void InsertAfter(FrogNode* nodeLoc); FrogNode* GetNext(); void PrintNodeData(); private: int tadpolesVal; FrogNode* nextNodePtr; };

FrogNode::FrogNode(int tadpolesInit, FrogNode* nextLoc) { this->tadpolesVal = tadpolesInit; this->nextNodePtr = nextLoc; }

void FrogNode::InsertAfter(FrogNode* nodeLoc) { FrogNode* tmpNext = nullptr;

tmpNext = this->nextNodePtr; this->nextNodePtr = nodeLoc; nodeLoc->nextNodePtr = tmpNext; }

FrogNode* FrogNode::GetNext() { return this->nextNodePtr; }

void FrogNode::PrintNodeData() { cout << this->tadpolesVal << endl; }

int main() { FrogNode* headFrog = nullptr; FrogNode* currFrog = nullptr; FrogNode* lastFrog = nullptr; int frogCount; int inputValue; int i;

cin >> frogCount; headFrog = new FrogNode(frogCount); lastFrog = headFrog; /* Your code goes here */

currFrog = headFrog; while (currFrog != nullptr) { currFrog->PrintNodeData(); currFrog = currFrog->GetNext(); }

return 0; }

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Financial management theory and practice

Authors: Eugene F. Brigham and Michael C. Ehrhardt

12th Edition

978-0030243998, 30243998, 324422695, 978-0324422696

Students also viewed these Programming questions