Question

Language:C++

only numbers 4 and 5 please

2. 1. Use the Node class from the slides to create a linked list of int's. Create a Node pointer called ptrHead that points to the head of the list. Make the list 5 nodes long. Generate random values to populate the list's data. All nodes should be in the heap. Add a function called addNodeFront that takes a pointer to the head of a list as an input parameter and that adds a new node with a randomly generated value to the front of the list. Return the new head node of the list. 3. Add a function called removeNodeBack that takes a pointer to the head of a list as an input parameter and that removes a node from the back of the list. 4. Add a function called sum that takes a pointer to the head of a list as an input parameter and which iterates through a list and returns the sum of the values. Add a function called reverse that takes a pointer to the head of a list as an input parameter and reverses the order of the list. Add a function called removeEven that takes a pointer to the head of a list as an input parameter and that deletes all nodes with a data value that is an even number. 7. In main write a short test driver to test the functions and show that they work. Your function should allow the user to create a new list and otherwise change the list. class Node { public: Node () ; float getData() const; void setData (float d) ; Node* getNodePtr () const; void setNodePtr (const Node* n) ; private: float data; Node* nextPtr; si

Answer 1

C++ Code:

#include <iostream>
using namespace std;
class Node {
   private:
       float data;
       Node* nextPtr;
   public :
   Node()
   {
       this->nextPtr = NULL;
   }
   float getData() const
   {
       return this->data;
   }
   void setData(float d)
   {
       this->data = d;
   }
   Node *getNodePtr() const
   {
       return this->nextPtr;
   }
   void setNodePtr(Node *n)
   {
       this->nextPtr = n;
   }
  
};
// revrese a list
Node* reverse(Node *head)
{
   // Initialize current, previous, next pointers
   Node* current = head;
   Node *prev = NULL, *next = NULL;

   while (current != NULL)
   {
       // before reversing store next of current
       next = current->getNodePtr();
       // Reverse current node's pointer
       current->setNodePtr(prev);
       // Move pointers one position ahead.
       prev = current;
       current = next;
   }
   head = prev;
   return head;
}
//print a list
void print(Node *head)
{
   struct Node* temp = head;
   while (temp != NULL) {
       cout << temp->getData ()<< " ";
       temp = temp->getNodePtr();
   }
}
// insert a value in front of list
Node *insert(Node *head, float data)
{
   Node* temp = new Node();
   temp->setData(data);
   temp->setNodePtr(head);
   head = temp;
   return head;
}
//returns sum of all element of list
float sum(Node *head)
{
   float total=0;
   struct Node* temp = head;
   while (temp != NULL) {
       total += temp->getData ();
       temp = temp->getNodePtr();
   }
   return total;
}
/* Driver program to test above function*/
int main()
{
   /* Start with the empty list */
   Node *head = NULL;
  
   // insert few values into list
   head = insert(head,20);
   head = insert(head,30);
   head = insert(head,40);
   head = insert(head,50);
   cout<<"The list is: ";
   print(head);
   cout<<"\nSum of all list elements is: "<<sum(head);
   //reverse the list
   head = reverse(head);
   cout<<"\nList after reversal is: ";
   print(head);
   return 0;
}
Sample output:

The list is: 50 40 30 20 Sum of all list elements is: 140 List after reversal is: 20 30 40 50 = = = = = = = = = = = = = = - - - Process exited after 0.1078 seconds with return value o Press any key to continue ...
Note: The functions except sum() and reverse() are just used for testing purpose.

If you have any doubts in this solution please ask them in comments.