C语言链表的长度怎么表示,c语言：双向链表（head->data中存储长度）

#includetypedef struct node

{

int data;

struct node * previous;

struct node * next;

} Node;

Node * head=(Node*)malloc(sizeof(Node));

Node * tail=(Node*)malloc(sizeof(Node));

void init()

{

Node *current = head;

head->next = tail;

tail->previous = head;

head->data=0;

for(int i=1;i<=12;i++)

{

Node *new_node=(Node*)malloc(sizeof(Node));

new_node->data = i;

new_node->previous = current;

current->next = new_node;

new_node->next = tail;

tail->previous = new_node;

current = current->next;

head->data = ++(head->data);//head->data存下链表元素个数！

}

};

void insert1(int a)

{ </