关于双向链表的建立

#include <iostream>
#include<stdlib.h>
using namespace std;
typedef struct node
{
	int data ;
	struct node *next ;
	struct node *prior;
}Node,*PNode;
void creat_linklist(PNode linklist, int n)
{
	for (int i = 0; i < n - 1; ++i)
	{
		PNode p;
		p = (PNode)malloc(sizeof(PNode));
		p->data = i;
		p->prior = linklist;
		p->next = linklist->next;
		linklist->next->prior = p;
		linklist->next = p;

	}

}
void main()
{

	int n = 10;
	PNode linklist,end;
	linklist = (PNode)malloc(sizeof(PNode));
	end = (PNode)malloc(sizeof(PNode));
	linklist->data = n;
	linklist->next = end;
	linklist->prior = NULL;
	end->data = 10;
	end->prior = linklist;
	end->next = NULL;

	creat_linklist(linklist, n);
	getchar();

}