c语言基础-链表

链表

typedef struct Node
{
int value;
struct Node * next;
}NODE, * PNODE;
int main()
{
PNODE phead;
PNODE pTap;
int pubValue;

pubValue = 100;
phead = malloc(sizeof(NODE));
pTap = phead;
phead->next = nil;
printf("ptap=%p\n",pTap);
return 1;
}

void addNOde()
{
printf("tap=%p\n",pTap);
PNODE p = malloc(sizeof(NODE));
p->value = pubValue++;
pTap ->next = p;
p->next = nil;
pTap = p;
printf("q=%p\n w=%p\n",pTap,p);
printf("%d\n",pTap->value);

}
void printfNode()
{
int len = 0;
PNODE p = phead->next;
while (nil!=p) {
len ++;
p = p->next;
}
printf("len=%d\n",len);
PNODE p2 = phead->next;
for (int i=0; i<len; i++) {
printf("value=%d\n",p2->value);
p2 = p2->next;
}
}
void insertNode()
{
PNODE p = phead->next;
PNODE q = malloc(sizeof(NODE));
q->value = 222;
q->next = p->next;
p->next = q;
printf("插入=%d\n",q->value);
}
void deleteNode()
{
PNODE p = phead->next;
PNODE q = (p->next)->next;
free(p->next);
p->next = q;
printf("删除");
}