软件英才网 软件行业驰名招聘网站

*pDLinkNode = pNode->next;

free(pNode);

delete_all_double_link_node(pDLinkNode);

}

（4）在双向链表中查找数据

DOUBLE_LINK_NODE* find_data_in_double_link(const DOUBLE_LINK_NODE* pDLinkNode, int data)

{

DOUBLE_LINK_NODE* pNode = NULL;

if(NULL == pDLinkNode)

return NULL;

pNode = (DOUBLE_LINK_NODE*)pDLinkNode;

while(NULL != pNode){

if(data == pNode->data)

return pNode;

pNode = pNode ->next;

}

return NULL;

}

（5）双向链表中插入数据

STATUS insert_data_into_double_link(DOUBLE_LINK_NODE** ppDLinkNode, int data) {

DOUBLE_LINK_NODE* pNode;

DOUBLE_LINK_NODE* pIndex;

if(NULL == ppDLinkNode)

return FALSE;

if(NULL == *ppDLinkNode){

pNode = create_double_link_node(data);

assert(NULL != pNode);

*ppDLinkNode = pNode;

(*ppDLinkNode)->prev = (*ppDLinkNode)->next = NULL;

return TRUE;

}