Question

Structure struct Node int Manth; // Mont h double dAvg: 1/ Average struct Node pNext // with, the linked İist 3hown above the function will return gven that the average is 3.8 Ptr to next -Node; Ret (3,3.8) (4,2.5) (20pts)( Recursive function) Show the code for a function that receives a pointer to the head of an ordered singly linked list that uses the structure in the top left. The function will return the pointer node that shows the highest average. 4、 5. (5pts) Show the trace to your program for problem 6 Name Example Structure typedef struct Node f With the 11nked list shown above the function will return 3 given that the average is 3.8 int iMonth; Month double dAve struct Nade phext; Ptr to next / Average 1 Node pRet 2,2.7 (5,2.0) 3.3.8) 4,2.5) 4. (20pts) (Recursive function) Show the code for a function that receives a pointer to the head of an ordered singly linked list that uses the structure in the top left. The function will return the pointer to the node that shows the highest average.

Answer 1

4.

// recursive function to return the node with the highest average
Node *highestAvg(Node *head)
{
   if(head == NULL) // check if input node is null, return null
       return NULL;
   else
   {
       Node *highest = highestAvg(head->pNext); // get the highest average for rest of the list
       if((highest != NULL)) //check if highest is not null
       {
           if(highest->dAvg > head->dAvg) //check if average of highest is greater than average of head then return highest
               return highest;
       }

       return head; // return head
   }
}