链表堆空间分配问题

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

Node *create();
void add();
void del();
void search();

Node *create(int v) {
    Node *first;
    first = (Node *)(calloc(1,sizeof(*first)));
    first->value = v;
    first->next = NULL;
    return first;
}
void add(Node **head,int v) {
    Node *p;
    p = (Node *)(calloc(1,sizeof(*p)));
    p->value = v;
    p->next = *head;
    *head = p;
    
}
void search(Node *head) {
    Node *p;
    p=head;
    while(p != NULL) {
        printf("address is %d;value address is %d;next address is %d;next content is %d\n",p,&(p->value),&(p->next),p->next);
        p = p->next;
    }
}



int main() {
    Node *head;
    head = create(0);
    add(&head,1);
    add(&head,2);
    add(&head,3);
    search(head);
    

}