数据结构：双向链表的实现和测试(C++).doc

《数据结构：双向链表的实现和测试(C++).doc》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、//在Doublelinkedlist.h内#include"utility.h"#includeusingnamespacestd;templatestructNode{Node_entryentry;Node*next;Node*back;Node();Node(Node_entryx,Node*link_back=NULL,Node*link_nex

2、t=NULL);};templateNode::Node(){next=NULL;back=NULL;}templateNode::Node(Node_entryx,Node*link_back,Node*link_next){entry=x;next=link_next;back=link_back;}template

3、entry>classList{public:List();voidclear();boolempty()const;boolfull()const;intsize()const;Error_codeinsert(intposition,constList_entry&x);Error_coderemove(intposition,List_entry&x);Error_coderetrieve(intposition,List_entry&x)const;Error_codereplace(intpo

4、sition,constList_entry&x);protected:intcount;mutableintcurrent_position;mutableNode*current;voidset_position(intpisition)const;};templateList::List(){count=0;current_position=0;current=NULL;}template

5、ry>voidList::clear(){List_entrytemp;for(inti=0;iboolList::empty()const{returncount==0;}templateboolList::full()const{returnfalse;}template

6、lassList_entry>intList::size()const{returncount;}templatevoidList::set_position(intposition)const{if(current_position<=position)for(;current_position!=position;current_position++)current=current->next;elsefor(;cur

7、rent_position!=position;current_position--)current=current->back;return;}templateError_codeList::insert(intposition,constList_entry&x){Node*new_node,*following,*preceding;if(position<0

8、

9、position>count)returnError_

10、code::range_error;if(position==0){if(count==0)following=NULL;else{set_position(0);following=current;}preceding=NULL;}else{set_position(position-1);preceding=current;following=preceding->next;}new_node=newNode(x