双循环链表就地逆置C++算法 ?

Question

C++算法：双循环链表就地逆置，用prior,next,data等实现。

Answer 1

struct Node{
Node* prior;
int data;
Node* next;
};

Node *list = new Node;
list->prior=NULL;
list->next =NULL;
list->data=0;

//初始化过程，你可以自己创建列表的剩余节点
......
//逆置过程
Node * header = list->next;
list->next = NULL;
while(header->next != NULL)
{
//针对单个节点的逆置过程
Node* temp;
temp = header->prior;
header->prior=list->next;
header->next =temp;
}
header->prior = NULL;
}