Algorithm node (struct node *HEAD)
Input: List with name, value, and link
Output: The orginial list without the highest value(s), and a list pointed by LARGE that contains the highest value(s) found in the list pointed by HEAD


struct node *LARGE;

node *currentVal = HEAD;
node *currentLargeVal = LARGE;
node *temp1;
node * temp2;
node *next = link; 

int p, q, Max;

if(currentVal == NULL)
{
    cout<<"Empty list"<<endl;
}
else
{
     temp1 = currentVal;
  
     for(currentVal = HEAD; currentVal != NULL; currentVal->next)
     { 
           p = temp1->value;
           q = temp1->next->value;
           if( p >= q)
           {
                 Max = p;
           } 
           else
           {
                 Max = q; 
           }
      } 
}// End of traversing the list to find the Max value in list pointed by HEAD

temp1 = currentVal;
temp2 = currentLargeVal;
for(currentVal = HEAD; currentVal != NULL; currentVal->next)
{
       if(temp1->value == Max)
        {
                if(currentLargeVal != NULL)
                { while (temp2 -> next != NULL)
                    {
                        temp2= temp2->next;
                    }
                      
                      temp2->next = Max;
                 }
        }
}

if (current->data== max){
   tmp = current;
  // is current the head, if so move the head. 
   prev->next = current->next;
   current       = current->next;
   tmp->next  = NULL;

   // we have tmp, add it to max list 

  .....
}
else{
  // update prev
  // update current 
}