雙向鏈表的建立

 struct Node<br />{<br /> int Data;<br /> struct Node* prior;<br /> struct Node* next;<br />};</p><p>/**<br />* @brief 該函數實現雙向鏈表的建立<br />* @return 返回雙向鏈表的頭指標<br />* @author wlq_729@163.com<br />* http://blog.csdn.net/rabbit729<br />* @version 1.0<br />* @date 2009-03-09<br />*/<br />Node* CreateDoubleList()<br />{<br /> Node* head = new Node;<br /> assert(head);<br /> head->prior = NULL;<br /> head->next = NULL;</p><p> Node* p = head;<br /> int data;<br /> bool bIsInput = true;<br /> while (bIsInput)<br /> {<br /> cin>>data;<br /> if (0 == data)<br /> {<br /> bIsInput = false;<br /> }<br /> else<br /> {<br /> Node* node = new Node;<br /> assert(node);<br /> node->Data = data;<br /> node->prior = p;<br /> node->next = NULL;</p><p> p->next = node;<br /> p = node;<br /> }<br /> }<br /> return head;<br />}