链表创建和遍历

最近学数据结构，重新看链表，说实话痛苦死了。不过好歹我还是都搞出来了。。
看代码：链表创建和遍历

#include<stdio.h>
#include<malloc.h>
typedef struct Node{
    int num;
    struct Node *next;
}Node;

int main(){
    Node *p,*head;
    int i=0,num;
    head= (Node *)malloc(sizeof(Node));
    p=head;
    for(i = 0;i<3;i++){
        scanf("%d",&num);
        Node *s = malloc(sizeof(Node));
        s->num = num;
        p->next = s;
        p=s;
    }
    printf("%d",(p == head));

    p = head;

    while(p->next){
        p = p->next;
        printf("%d",p->num);
    }

    return 0;
}

也可以这么写：

#include<stdio.h>
#include<malloc.h>
typedef struct Node{
    int num;
    struct Node *next;
}Node;

int main(){
    Node *p,*pOld,*head;
    int i=0,num;
    head= (Node *)malloc(sizeof(Node));
    p=head;
    for(i = 0;i<3;i++){
        scanf("%d",&num);
        pOld = p;
        p = malloc(sizeof(Node));
        p->num = num;
        pOld->next = p;
    }

    p = head;
    //printf("%d",p->num);
    while(p->next){
        p = p->next;
        printf("%d",p->num);
    }

    return 0;
}