1 PNODE Create() {
 2     int len;    //total count of nodes to be created.
 3     int i;
 4     int val; //temp value for the current node.
 5     printf("enter the size of nodes:");
 6     scanf("%d", &len);
 7     PNODE pHead = (PNODE)malloc(sizeof(PNODE));
 8     pHead->pNext = NULL;
 9     PNODE pTail = pHead;
10 
11     if(NULL == pHead) {
12         printf("allocate memory failed!");
13         exit(0);
14     }
15     for (i = 0; i < len; i++)
16     {
17         PNODE pCur = (PNODE)malloc(sizeof(PNODE));
18         if(NULL == pCur) {
19             printf("allocate memory failed!");
20             exit(0);
21         }
22         printf("enter the %d-th value : ", i + 1);
23         scanf("%d", &val);
24         pCur->data = val;
25 
26         //set the new node as the tail node.
27         pTail->pNext = pCur;    
28         pCur->pNext = NULL;
29         pTail = pCur;
30     }
31     return pHead;
32 }

1 typedef struct node {
2     int data;
3     struct node * pNext;
4 } NODE, * PNODE;

 1 bool Delete(PNODE pHead, int pos, int *v) {
 2     int i = -1;
 3     PNODE pNode = pHead;
 4     while((i < pos - 1) && pNode != NULL) {
 5         pNode = pNode->pNext;
 6         i++;
 7     }
 8     if(pos < i || pNode == NULL)
 9         return false;
10     PNODE pTmp = pNode->pNext;    //store to free later.
11     *v = pTmp->data;
12     pNode->pNext = pNode->pNext->pNext;
13     free(pTmp);
14     pTmp = NULL;
15     return true;
16 }

1 PNODE pNew = (PNODE)malloc(sizeof(PNODE));

1 PNODE pNew = (PNODE)malloc(sizeof(NODE));