This is a C++ problem dealing with linked lists. Finish the program so that it f

Question

This is a C++ problem dealing with linked lists.

Finish the program so that it finds and prints the smallest value in the linked list.

#include <iostream>

#include <cstdlib>
using namespace std;

class IntNode {
public:
IntNode(int dataInit = 0, IntNode* nextLoc = 0);
void InsertAfter(IntNode* nodePtr);
IntNode* GetNext();
void PrintNodeData();
int GetDataVal();
private:
int dataVal;
IntNode* nextNodePtr;
};

// Constructor
IntNode::IntNode(int dataInit, IntNode* nextLoc) {
this->dataVal = dataInit;
this->nextNodePtr = nextLoc;
return;
}

/* Insert node after this node.
* Before: this -- next
* After: this -- node -- next
*/
void IntNode::InsertAfter(IntNode* nodeLoc) {
IntNode* tmpNext = 0;

tmpNext = this->nextNodePtr; // Remember next
this->nextNodePtr = nodeLoc; // this -- node -- ?
nodeLoc->nextNodePtr = tmpNext; // this -- node -- next
return;
}

// Print dataVal
void IntNode::PrintNodeData() {
cout << this->dataVal << endl;
return;
}

// Grab location pointed by nextNodePtr
IntNode* IntNode::GetNext() {
return this->nextNodePtr;
}

int IntNode::GetDataVal() {
return this->dataVal;
}

int main() {
IntNode* headObj = 0; // Create intNode objects
IntNode* currObj = 0;
IntNode* lastObj = 0;
int i = 0; // Loop index

headObj = new IntNode(-1); // Front of nodes list
lastObj = headObj;

for (i = 0; i < 20; ++i) { // Append 20 rand nums
currObj = new IntNode(rand());
  
lastObj->InsertAfter(currObj); // Append curr
lastObj = currObj; // Curr is the new last item
}

currObj = headObj; // Print the list
currObj = currObj->GetNext();
while (currObj != 0) {
currObj->PrintNodeData();
currObj = currObj->GetNext();
}

// FIXME: Loop through list and find minimum dataVal

return 0;
}

Explanation / Answer

modified the code to get min value

#include <iostream>

#include <cstdlib>
using namespace std;

class IntNode {
public:
   IntNode(int dataInit = 0, IntNode* nextLoc = 0);
   void InsertAfter(IntNode* nodePtr);
   IntNode* GetNext();
   void PrintNodeData();
   int GetDataVal();
public:
   int dataVal;
   IntNode* nextNodePtr;
};

// Constructor
IntNode::IntNode(int dataInit, IntNode* nextLoc) {
   this->dataVal = dataInit;
   this->nextNodePtr = nextLoc;
   return;
}

/* Insert node after this node.
* Before: this -- next
* After: this -- node -- next
*/
void IntNode::InsertAfter(IntNode* nodeLoc) {
   IntNode* tmpNext = 0;

   tmpNext = this->nextNodePtr;    // Remember next
   this->nextNodePtr = nodeLoc;    // this -- node -- ?
   nodeLoc->nextNodePtr = tmpNext; // this -- node -- next
   return;
}

// Print dataVal
void IntNode::PrintNodeData() {
   cout << this->dataVal << endl;
   return;
}

// Grab location pointed by nextNodePtr
IntNode* IntNode::GetNext() {
   return this->nextNodePtr;
}

int IntNode::GetDataVal() {
   return this->dataVal;
}

int main() {
   IntNode* headObj = 0; // Create intNode objects
   IntNode* currObj = 0;
   IntNode* lastObj = 0;
   int i = 0;            // Loop index

   headObj = new IntNode(-1);        // Front of nodes list
   lastObj = headObj;

   for (i = 0; i < 20; ++i) {        // Append 20 rand nums
      currObj = new IntNode(rand());
    
      lastObj->InsertAfter(currObj); // Append curr
      lastObj = currObj;             // Curr is the new last item
   }

   currObj = headObj;                // Print the list
   currObj = currObj->GetNext();
   int min=currObj->dataVal;
   while (currObj != 0) {
       if (currObj->dataVal < min)
       min = currObj->dataVal;
      currObj->PrintNodeData();
      currObj = currObj->GetNext();
   }
  
   cout<<"minimum value in the linked list is"<<min;
   // FIXME: Loop through list and find minimum dataVal



   return 0;
}

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.