「二分木 続き 12」 int skip_delete(struct Skip **list, int search_key) { struct Skip *update[MAX_LEVEL] = {0}; struct Skip *x; int i; x = *list; for (i = (*list)->level - 1; i >= 0; i--) { while (x->forward[i] != NULL && x->forward[i]->dat…