#include #include #include using namespace std; /* This program creates a linked list of 15 nodes, searches through the list for negative node values, then prints the node address, the node value, and whether or not it's negative. */ class IntNode { public: IntNode(int dataInit = 0, IntNode* nextLoc = nullptr); void InsertAfter(IntNode* nodePtr); IntNode* GetNext(); int GetDataVal(); private: int dataVal; IntNode* nextNodePtr; }; // Constructor IntNode::IntNode(int dataInit, IntNode* nextLoc) { this->dataVal = dataInit; this->nextNodePtr = nextLoc; } /* Insert node after this node. * Before: this -- next * After: this -- node -- next */ void IntNode::InsertAfter(IntNode* nodeLoc) { IntNode* tmpNext = nullptr; tmpNext = this->nextNodePtr; // Remember next this->nextNodePtr = nodeLoc; // this -- node -- ? nodeLoc->nextNodePtr = tmpNext; // this -- node -- next } // Grab location pointed by nextNodePtr IntNode* IntNode::GetNext() { return this->nextNodePtr; } int IntNode::GetDataVal() { return this->dataVal; } int main() { IntNode* headObj = nullptr; // Create intNode objects IntNode* currObj = nullptr; IntNode* lastObj = nullptr; int i; int negativeCntr; negativeCntr = 0; headObj = new IntNode(-1); // Front of nodes list lastObj = headObj; for (i = 0; i < 15; ++i) { // Append 25 rand nums currObj = new IntNode((rand() % 210) - 100); lastObj->InsertAfter(currObj); // Append curr lastObj = currObj; // Curr is the new last item } currObj = headObj; // Print the list cout << endl << setw(30) << "LINKED LIST VALUES\n" << endl; for (int j = 1; j <= 15; ++j) { if (currObj != nullptr) { cout << setw(8) << "ITEM" << setw(14) << "MEM ADDRESS" << setw(13) << "OBJ VALUE" << endl << setw(4) << "" << setfill('-') << setw(31) << "" << endl << setfill(' ') << setw(8) << j << setw(2) << "|" << setw(10) << currObj << setw(4) << "|" << setw(8) << currObj->GetDataVal(); if (currObj->GetDataVal() < 0) { cout << setw(16) << "---> NEGATIVE" << endl; } else { cout << endl; } cout << setw(4) << "" << setfill('-') << setw(31) << "" << endl << setfill(' ') << endl; currObj = currObj->GetNext(); } } cout << endl; currObj = headObj; // Count number of negative numbers while (currObj != nullptr) { if (currObj->GetDataVal() < 0) { negativeCntr++; } currObj = currObj->GetNext(); } cout << "Number of negatives: " << negativeCntr << endl; return 0; }

Example Linked List