Question

001- 1. Write a C++ function which has a pointer to a linked list as one of its parameters. The function produces two linked "sublists" of the original list. One sublist consists of nodes with info values greater than 0, corresponding to nodes in the original list with info values greater than 0. The second sublist consists of nodes with info values less than 0. corresponding to nodes in the original list with info values less than 0. Write a main() program to get file input for creating a linked list, call your function, and output the original list and the two sublists.

This is the creatList and printList function

#include <iostream>
#include <fstream>
using namespace std;
struct nodeType
{
   int info;
   nodeType *link;
   nodeType *next;
   double value;

};
void createList(nodeType*& first, nodeType*& last, ifstream& inf);
void printList(nodeType* first);
int main()
{
   nodeType *first, *last;
   int num;
   ifstream infile;
   infile.open("InputIntegers.txt");
   createList(first, last, infile);
   printList(first);

   infile.close();
   system("pause");
   return 0;
}
void createList(nodeType*& first, nodeType*& last, ifstream& infile)
{
   int number;
   nodeType *newNode;
   first = nullptr;
   last = nullptr;

   infile >> number;
   while (infile)
   {
       newNode = new nodeType;
       newNode->info = number;
       newNode->link = nullptr;

       if (first == nullptr)
       {
           first = newNode;
           last = newNode;
       }
       else
       {
           last->link = newNode;
           last = newNode;
       }
       infile >> number;
   }
}

void printList(nodeType* first)
{
   int i = 0;
   nodeType *current;
   current = first;
   while (current != nullptr)
   {
       i++;
       cout << current->info << " ";
       if (i % 10 == 0)
           cout << endl;
       current = current->link;
   }
   cout << endl<<endl;
}

InputFile:

2 4 10 28 50 14 -5 9 -2 30 15 -25 64 22 18
-28 14 30 -45 -16 4 5 -12 8
31 -50 -72 -41 -61 -7 100 -33
-20 -18 -6 -43 -15 -22 -21 -1
-7 -8 -14 -3 -11 -26 19 -9 -23
-55 1450
18189
1680
5
65
9630 275 400 300 700 200 100
5287 30 248 31 45 200
1700 305 528 602 13 85
11 19 30 49

Answer 1

#include <iostream>

#include <fstream>

using namespace std;

struct nodeType

{

   int info;

   nodeType *link;

   //nodeType *next; // not required

   //double value; // not required

};

void createList(nodeType*& first, nodeType*& last, ifstream& inf);

void printList(nodeType* first);

void sublist(nodeType *first, nodeType *&pos, nodeType *&neg);

int main() {

       nodeType *first, *last, *pos, *neg;

       //int num;

       ifstream infile;

       infile.open("InputIntegers.txt");

       createList(first, last, infile);

       cout<<"List : "<<endl;

       printList(first);

       infile.close();

       sublist(first,pos,neg);

       cout<<"Positive list : "<<endl;

       printList(pos);

       cout<<"Negative list : "<<endl;

       printList(neg);

       system("pause");

       return 0;

}

// function to create a linked list of integer read from a file

void createList(nodeType*& first, nodeType*& last, ifstream& infile)

{

   int number;

   nodeType *newNode;

   first = nullptr;

   last = nullptr;

   infile >> number;

   while (infile)

   {

       newNode = new nodeType;

       newNode->info = number;

       newNode->link = nullptr;

       if (first == nullptr)

       {

           first = newNode;

           last = newNode;

       }

       else

       {

           last->link = newNode;

           last = newNode;

       }

       infile >> number;

   }

}

// function to print a linked list

void printList(nodeType* first)

{

   int i = 0;

   nodeType *current;

   current = first;

   while (current != nullptr)

   {

       i++;

       cout << current->info << " ";

       if (i % 10 == 0)

           cout << endl;

       current = current->link;

   }

   cout << endl<<endl;

}

// function to create two sublist pos and neg from list first where pos contains the positive integers and neg contains the negative integers of first

void sublist(nodeType *first, nodeType *&pos, nodeType *&neg)

{

       pos = nullptr;

       neg = nullptr;

       nodeType *node = first;

       // loop over the list

       while(node != nullptr)

       {

             nodeType *curr = new nodeType;

             curr->info = node->info;

             curr->link = nullptr;

             // check if value is > 0 insert in pos else insert in neg

             if(node->info > 0)

             {

                    if(pos == nullptr)

                           pos = curr;

                    else

                    {

                           nodeType *temp = pos;

                           while(temp->link != nullptr)

                                 temp = temp->link;

                           temp->link = curr;

                    }

             }else

             {

                    if(neg == nullptr)

                           neg = curr;

                    else

                    {

                           nodeType *temp = neg;

                           while(temp->link != nullptr)

                                 temp = temp->link;

                           temp->link = curr;

                    }

             }

             node = node->link;

       }

}

//end of program

Output:

Input file:

24 10 28 50 14 -5 9 -2 30 15 -25 64 22 18 -28 14 30-45 -16 4 5 -12 8 31 -50 -72 -41 -61 -7 100 -33 -20 -18-6 -43 -15 -22 -21 -1 -7 -8 -14 -3 -11 -26 19 -9 -23 -55 1450 18189 1680 5 65 9630 275 400 300 700 200 100 5287 30 248 31 45 200 1700 305 528 602 13 85 11 19 30 49

Output:

List 2 4 10 28 50 14 -5 9-2 30 15 -25 64 22 18 -28 14 30 -45 -16 4 5 -12 8 31 -50 -72 -41 -61 -7 100 -33 -20 -18 -6 -43 -15 -22 -21 -1 -7 -8 -14 -3 -11 -26 19 -9 -23 -55 1450 18189 1680 5 65 9630 275 400 300 700 200 100 5287 30 248 31 45 200 1700 305 528 602 13 85 11 19 30 49 Positive list 24 10 28 50 14 9 30 15 64 22 18 14 30 4 5 8 31 100 19 1450 18189 1680 5 65 9630 275 400 300 700 200 100 5287 30 248 31 45 200 1700 305 528 602 13 85 11 19 30 49 Negative list -5 -2 -25 -28 -45 -16 -12 -50 -72 -41 -61 -7 -33 -20 -18 -6 43 -15 -22 -21 -1 -7 -8 -14 -3 -11 -26 -9 -23 -55