双向循环链表

---

一、结构体

typedef struct Node
{
   
	int data;   //数据
	//左右指针
	struct Node* leftNode;  
	struct Node* rightNode;
}NODE,*LPNODE;

二、生成节点

LPNODE createNode(int data)
{
   
	LPNODE newNode = (LPNODE)malloc(sizeof(NODE));
	if (newNode == NULL)
		return NULL;
	newNode->data = data;
	newNode->leftNode = NULL;
	newNode->rightNode = NULL;
	return newNode