#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "sort_list.h"

Node * new_node(value_type value, key_type key)
{
Node * newNode = (Node *)malloc(sizeof(Node));
#ifdef CHAR
strcpy_s(newNode->value, 80, value);
#else
newNode->value = value;
#endif
newNode->key = key;
newNode->next = NULL;
newNode->sort = NULL;
newNode->prev = NULL;
newNode->prev_sorted = NULL;
return newNode;
}

int size(Sorted_List * sortedList)
{
return sortedList->size;
}

int push(Sorted_List * sortedList, value_type value, key_type key)
{
Node * newNode = new_node(value, key);
Node * tmpNode = NULL;
if (sortedList->head == NULL)
{
sortedList->head = newNode;
sortedList->head_sort = newNode;
sortedList->tail = newNode;
sortedList->tail_sort = newNode;
}
else
{
newNode->next = sortedList->head;
sortedList->head->prev = newNode;
sortedList->head = newNode;
tmpNode = sortedList->head_sort;
while ((tmpNode) && (key > tmpNode->key))
{
         tmpNode = tmpNode->sort;
}
if (!tmpNode)
{
         newNode->prev_sorted = sortedList->tail_sort;
         sortedList->tail_sort->sort = newNode;
         newNode->sort = NULL;
         sortedList->tail_sort = newNode;
}
   else
   {
         newNode->sort = tmpNode;
         newNode->prev_sorted = tmpNode->prev_sorted;
         if (tmpNode->prev_sorted)
         {
            tmpNode->prev_sorted->sort = newNode;
         }
         tmpNode->prev_sorted = newNode;
   }
if (tmpNode == sortedList->head_sort)
{
         sortedList->head_sort = newNode;
}
}
sortedList->size++;
return SUCCESS;
}

int append(Sorted_List * sortedList, value_type value, key_type key)
{
Node * newNode = NULL;
Node * tmpNode = NULL;
if (sortedList->head == NULL)
{
   push(sortedList, value, key);
}
else
{
   newNode = new_node(value, key);
   newNode->prev = sortedList->tail;
   sortedList->tail->next = newNode;
   sortedList->tail = newNode;
   tmpNode = sortedList->tail_sort;
   while ((tmpNode) && (key < tmpNode->key))
   {
         tmpNode = tmpNode->prev_sorted;
   }
   if (!tmpNode)
   {
         newNode->sort = sortedList->head_sort;
         sortedList->head_sort->prev_sorted = newNode;
         newNode->prev_sorted = NULL;
         sortedList->head_sort = newNode;
   }
   else
   {
         newNode->prev_sorted = tmpNode;
         newNode->sort = tmpNode->sort;
         if (tmpNode->sort)
         {
            tmpNode->sort->prev_sorted = newNode;
         }
         tmpNode->sort = newNode;
   }
   if (tmpNode == sortedList->tail_sort)
   {
         sortedList->tail_sort = newNode;
   }
   sortedList->size++;
}
return SUCCESS;
}

int remove_first(Sorted_List * sortedList, value_type * value, key_type * key)
{
Node * tmpNode = NULL;
if (!sortedList->head)
{
   printf("\nCan't remove from empty list.\n");
   return FAIL;
}
#ifdef CHAR
strcpy_s(value, 80, sortedList->head->value);
#else
*value = sortedList->head->value;
#endif
*key = sortedList->head->key;
if (sortedList->head->sort)
{
   sortedList->head->sort->prev_sorted = sortedList->head->prev_sorted;
   if (!sortedList->head->sort->prev_sorted)
   {
         sortedList->head_sort = sortedList->head->sort;
   }
}

INSTRUCTIONS: Create a new directory named lab6. 1. In a module n...