数据结构-带头结点的循环链表.docx

File chainNode.h#ifndef chainNode_#define chainNode_template class Tstruct chainNode{ // data members T element; chainNodeT *next; // methods chainNode() {next=NULL;} chainNode(const T element) { this-element = element; this-next=NULL; } chainNode(const T element, chainNodeT* next) {this-element = element; this-next = next;}};#endifFile linnerList.h// abstract class linearList// abstract data type specification for linear list data structure// all methods are pure virtual functions#ifndef linearList_#define linearList_#include iostreamusing namespace std;templateclass Tclass linearList{ public: virtual ~linearList() {}; virtual bool empty() const = 0; // return true iff list is empty virtual int size() const = 0; // return number of elements in list virtual T get(int theIndex) const = 0; // return element whose index is theIndex virtual int indexOf(const T theElement) const = 0; // return index of first occurence of theElement virtual void erase(int theIndex) = 0; // remove the element whose index is theIndex virtual void insert(int theIndex, const T theElement) = 0; // insert theElement so that its index is theIndex virtual void output(ostream out) const = 0; // insert list into stream out};#endifFile circularListWithHeader.h// circularList list with header node and iterator#ifndef circularListWithHeader_#define circularListWithHeader_#includeiostream#includesstream#includestring#include chainNode.h#include myExceptions.h#include linearList.husing namespace std;templateclass Tclass circularListWithHeader{ public: // 构造函数 circularListWithHeader(); // some methods bool empty(){return listSize = 0;} int size() const {return listSize;} T get(int theIndex) const; int indexOf(const T theElement) const; void erase(int theIndex); void insert(int theIndex, const T theElement); void output(ostream out) const; void reverse(); // iterators to start and end of list class iterator; iterator begin() {return iterator(headerNode-next);} iterator end() {return iterator(headerNode);}