Question

A linked list of integers is built using the following struct:
struct node {
  int data;
  struct node *next;
};
Define a function named max that returns the maximum integer in a list. The function takes one arguments, a pointer to the head of the list. The function returns an integer, which is the maximum value. If the list is empty, return zero. NOTE: You know nothing about the values in the list. They could all be negative!

Answer 1

#include <iostream>

using namespace std;

struct node
{
int data;
struct node *next;
};

class list
{
private:

public:
node * head, *tail;
list ()
{
head = NULL;
tail = NULL;
}
void createnode (int value)
{
node *temp = new node;
temp->data = value;
temp->next = NULL;
if (head == NULL)
{
head = temp;
tail = temp;
temp = NULL;
}
else
{
tail->next = temp;
tail = temp;
  
}
}
  
void display()
{
node *temp=new node;
temp=head;
while(temp!=NULL)
{
cout<<temp->data<<"\t";
temp=temp->next;
}
}
  
};

int max (node *head)
{
int maxi = 0;
int count =0;
node *temp=new node;
temp=head;
while(temp!=NULL)
{
if(temp->data > maxi)
{
maxi = temp->data;
}
temp=temp->next;
count++;
}
if(count == 0)
return 0;
else
return maxi;
}
int main ()
{
int num;
int dat;
list a;
cout<<"Enter the number of elements: \n";
cin >> num;
cout<<"Enter the elements: \n";
for(int i=0;i<num;i++)
{
cin>> dat;
a.createnode(dat);
}
cout<<"Entered numbers as follows: \n";
a.display();
int maximum = max(a.head);
cout<<"\nThe maximum of the elements is :"<<maximum;
return 0;
}

Sample output: