Question

I need help and have to get this done asap: Using the following source codes provided below, create recursive functions and methods in C++ to complete the following exercises:

1. Print the list in forward order
2. Print the list in reverse order
3. Print the following three lines (in this order):

   "The first node contains <value in first node>"

   "The last node contains <value in last node>"

   "The first node contains <value in first node>"

4. Print the sum of all the values in the list.
5. Returns the sum of all the values in the list.
6. Returns the sum of all the values in the list (again, but done differently), sum them up going backwards through the list.
7. Returns the average of all the values in the list.
8. Return the value in the middle node.
9. Move the data from the first node to the last node.
10. Move the data from the first node to the last node, and the data from the last node to the first node.
11. Make the first node the last node, and the last node the first node (don’t just move the data, move the entire node).
12. Remove every even node (consider the first node, the one pointed to by head, to be node 1, an odd node).

Code:

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;
}

Please complete all, thank you!

Answer 1

Add allolowi nyour Intlist.p un cho intList .pit ThrteLines -) heo d while (temp-next 岰 tev"P-.ne4 emp cs canne CamScannér CS

Sum Reverse ( Noce ohead e a urm Nods head this → while. (.head → next value head-, daka Camscanner

hongetisst Las Node heads while (6etemp --)-next 一6.) |Beid Int List"-Reverse List this →-head . No de 꾸 head od Curr -r next Node : ead Can canne

thead ..ead → next- head → next→ next 'head -:- Read → next -te 名ead have beem made. cs CS Camscanner