Question

I really need help making a linked list program in C++, the program in total should have 3 source files:

• IntList.h
• IntList.cpp
• IntListTest.cpp

The class should contain the following functions:

• Constructor
• Destructor (should use removeAll() function)
• insert(int) - inserts the given int into the list (in order, duplicates are allowed)
• remove(int) - removes the given int from the list. Returns true if successful, false otherwise.
• print() - prints the list in-order (all on one line, comma delimited; no comma at the end, a newline instead)
• count() - returns a count of the number of ints in the list.
• sum() - returns the sum of the numbers in the list.
• average() - returns the average of the numbers in the list.
• find(int) - returns the given strings position in the list (e.g. 1 if first, 2 if 2nd, etc..). Returns 0 if the item is not in the list.
• removeAll() - removes all ints from the list

int main() should be implemented in IntListTest.cpp, and should do the following:

1. Insert the numbers 10, 20, 30, and 5; then print the count and items in the list
2. Delete 5; then print the count and items in the list
3. Delete 20 and 30; then print the count and items in the list
4. Delete 10; then print the count and items in the list

Please refrain from using standard template libraries. Thank you.

Answer 1

intList.h

#ifndef _INTLIST_H
#define _INTLIST_H
#include<iostream>
using namespace std;

class Node
{
public:
Node* next;
int data;
};

class intList
{
public:
  
Node* head;

intList();
~intList();
void insert(int);
   bool remove(int);
   int count();
   int sum();
   double average();
   int find(int);
   void removeAll();
void print();
};
#endif

IntList.cpp

#include"IntList.h"

intList::intList()
{
this->head = NULL;
}
void intList::insert(int data)
{
Node* node = new Node();
node->data = data;
   node->next=NULL;
   if(head==NULL)
   {
       head=node;
   }
   else
   {
       Node* tempHead = this->head;
       while(tempHead->next!=NULL)
       {
           tempHead = tempHead->next;
       }
       tempHead->next=node;
   }
}
void intList::print()
{
Node* head = this->head;
int i = 1;
   if(head==NULL)
   {
       cout<<"List is empty";
       return ;
   }
while(head->next!=NULL){
cout<<head->data<<",";
head = head->next;
}
   cout<<head->data<<endl;
}
int intList::count()
{
   int count=0;
   Node* tempHead = this->head;
   while(tempHead)
   {
       count++;
       tempHead = tempHead->next;
   }
   return count;
}
int intList::sum()
{
   int sum=0;
   Node* tempHead = this->head;
   while(tempHead)
   {
       sum+=tempHead->data;
       tempHead = tempHead->next;
   }
   return sum;
}
double intList::average()
{
   double avg=sum()/(double)count();
   return avg;
}
int intList :: find(int item)
{
   int index=0;
   Node* tempHead = this->head;
   while(tempHead)
   {
       if(item==tempHead->data)
           return index+1;
       tempHead = tempHead->next;
       index++;
   }
   return 0;
}
bool intList::remove(int item)
{
   if(head->data==item)
   {
       head=head->next;
       return true;
   }
   Node* prevNode = this->head;
   Node* nextNode = this->head;
   while(nextNode)
   {
       if(nextNode->data==item)
           break;
       prevNode=nextNode;
       nextNode=nextNode->next;
   }
   prevNode->next=nextNode->next;
   return true;
}
void intList::removeAll()
{
   Node* nextNode = this->head;
   while(nextNode)
   {
       remove(nextNode->data);
       nextNode=nextNode->next;
   }
}

IntListTest.cpp

#include"IntList.h"

int main()
{
   intList* list = new intList();
   list->insert(10);
   list->insert(20);
   list->insert(30);
   list->insert(5);
   cout<<"Count is : "<<list->count()<<endl;
   cout<<"Elements in the list are: ";
   list->print();

   list->remove(5);
   cout<<"\n\nAfter removing 5 from the list:"<<endl;
   cout<<"Count is : "<<list->count()<<endl;
   cout<<"Elements in the list are: ";
   list->print();

   list->remove(20);
   list->remove(30);
   cout<<"\n\nAfter removing 20 and 30 from the list:"<<endl;
   cout<<"Count is : "<<list->count()<<endl;
   cout<<"Elements in the list are: ";
   list->print();

   list->remove(10);
   cout<<"\n\nAfter removing 10 from the list:"<<endl;
   cout<<"Count is : "<<list->count()<<endl;
   cout<<"Elements in the list are: ";
   list->print();

   cout<<endl;
   return 1;
}

output

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.