typedef struct Node {/单链表结点结构体定义/
DataType data;
struct Node* next;
}SLNode;
void ListInitiate(SLNode **head) {/单链表初始化/
head = (SLNode)malloc(sizeof(SLNode));
(*head)->next = NULL;
}
int ListLength(SLNode* head) {/* 求单链表数据元素个数*/
SLNode *p = head;
int size = 0;
while (p->next != NULL) {
p = p->next;
size++;
}
return size;
}
int ListInsert(SLNode* head, int i, DataType x) {/插入/
SLNode* p, * q;
int j;
p = head;
j = -1;
while (p->next != NULL && j < i - 1) {
p = p->next;
j++;
}
if (j != i - 1) {
printf(“插入位置参数错!”);
return 0;
}
q = (SLNode*)malloc(sizeof(SLNode));
q->next = x;
q->next = p->next;
p->next = q;