双链表的创建、初始化、遍历插入、删除(C/C++)
已经全部测试过,代码没有问题。。。
#include <iostream>
using namespace std;
struct DulNode
{
int data;
DulNode* prior;
DulNode* next;
};
//双向链表的创建
DulNode* CreateDulList(DulNode* head, int n)
{
DulNode * p;
DulNode* s = new DulNode;
head->next = s;
head->next->prior = NULL;
p = s;
for (int i = 2; i <= n; i++)
{
DulNode* q = new DulNode;
p->next = q;
p->next->prior = s;
p = q;
}
p-