さゆがC/C++の宿題を片付けるの 36代目

6.
#include <stdio.h>

void insert(NODE **tbl, SCHEDULE dt)
{
  NODE *n;
  NODE **p;
  if(!(n = malloc(sizeof(NODE)))){
    fprintf(stderr, "ぬるぽ\n");
    exit(1);
  }
  n->Data = dt;
  n->Next = NULL;
  for(p = &tbl[hash(dt.Day)]; *p && (*p)->Time < dt.Time; *p = (*p)->Next){}
  if(!*p){
    *p = n;
  }else{
    if((*p)->Time != dt.Time){
      n->Next = *p;
      *p = n;
    }else{
      NODE *q = *p;
      n->Next = (*p)->Next;
      *p = n;
      free(q);
    }
  }
}