c++实现双向链表的建立,插入,删除,合并,打印

#include <stdlib.h>
#include <iostream>

using namespace std;

//双向链表的节点结构
typedef struct DuLNode{
	int data;
	struct DuLNode *prior;
	struct DuLNode *next;
}DuLNode, *DuLinkList;

//创建双向链表
void Create_DuList(DuLinkList &L, int n)
{
	int i, count = 1, InitLNodeNum;
	DuLNode *p, *q, *temp;
	cout << "Create doubly linked list!" << endl << "==========================" << endl;
	cout << endl << "Please input the Init DuLinkNode Number: <eg. 5> ";
	cin >> InitLNodeNum;

	L = (DuLinkList)malloc(sizeof(DuLNode));	//分配1个DuLNode型存储单元，并将这个分配的存储单元的首地址存储到节点变量L中
	cout << "Please input the data for DuLinkList Nodes: <eg. 22,86,6,88,99,...>" << endl;
	cout << "Your inputs: ";

	L->next = L;
	L->prior = L;
	q =