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

  1. 1、本文档共21页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
数据结构-带头结点的循环链表

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);}

文档评论(0)

xcs88858 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8130065136000003

1亿VIP精品文档

相关文档