doublecirchain.cpp

常用算法与数据结构原代码

// reverse a doubly linked circular list
// with head node

#include <iostream.h>
#include "DoubleCirChain.h"

void main(void)
{
   int n = 11;
   DoubleCirChain<int> C;
   for (int i = 0; i < n; i++)
      C.Insert(0,i);
   cout << "The list is" << endl;
   cout << C << endl;
   
   C.Reverse();
   cout << "After reversal, the list is" << endl;
   cout << C << endl;
   
   DoubleCirChainIterator<int> p;
   int *q = p.Initialize(C);
   cout << "List in sequence is ";
   while (q) 
   {
	   cout << *q << ' '; 
	   q = p.Next();
   }
   cout << endl;
}