数据结构之双向循环链表
实例代码:
#include <stdlib>
#include <stdio>
#include <malloc>
typedef struct Node{
struct Node *pNext;
int data;
struct Node *prior;
} NODE,*PNODE;
PNODE CreatList();
void TreNode(PNODE pHead);
bool isEmpty(PNODE pHead);
int getCount(PNODE pHead);
bool insertNode (PNODE pHead,int