int data;

struct Node* next;

struct Node* before;

}Node;

函数原型：

Node* create();

int insert_list(Node* p_list,int element);

void display(Node* p_list);

Node *create(){

Node *list=(Node*)malloc(sizeof(Node)); assert(list!=NULL);

list->next=NULL;

list->before=NULL;

list->data=0;

return list;

}

int insert_list(Node *p_list,int element){

assert(p_list != NULL);

assert(p_stu != NULL);

struct Node* pnode_current = p_list;

struct Node* pnode_next = pnode_current->next; struct Node* newnode;

while(pnode_next != NULL){