>>518
ちょい自信ないが参考になれば・・・。
int nodeDelete(node_t **ndPtrPtr, int n)
{
int i;
node_t * ndPtr;

if (n < 0) return FAILURE;
for (i = 0; i < n-1 && (*ndPtrPtr)->next != NULL; i++) {
ndPtrPtr = &((*ndPtrPtr)->next);
}

if ((i != n) || ((*ndPtrPtr)->next == NULL)) return FAILURE;
ndPtr = (*ndPtrPtr)->next;
if (ndPtr->next == NULL) (*ndPtrPtr)->next = NULL;
else (*ndPtrPtr)->next = ndPtr->next;
delete ndPtr;
return SUCCESS;
}