一步一步写算法(之双向链表)(3)

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

if(NULL != find_data_in_double_link(*ppDLinkNode, data))

return FALSE;

pNode = create_double_link_node(data);

assert(NULL != pNode);

pIndex = *ppDLinkNode;

while(NULL != pIndex->next)

pIndex = pIndex->next;

pNode->prev = pIndex;

pNode->next = pIndex->next;

pIndex->next = pNode;

return TRUE;

}

（6）双向链表中删除数据

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

DOUBLE_LINK_NODE* pNode;

if(NULL == ppDLinkNode || NULL == *ppDLinkNode)

return FALSE;

pNode = find_data_in_double_link(*ppDLinkNode, data);

if(NULL == pNode)

return FALSE;

if(pNode == *ppDLinkNode){

if(NULL == (*ppDLinkNode)->next){

*ppDLinkNode = NULL;

}else{

*ppDLinkNode = pNode->next;

(*ppDLinkNode)->prev = NULL;

}

}else{

if(pNode->next)

pNode->next->prev = pNode->prev;

pNode->prev->next = pNode->next;

}