双向链表模板.docVIP

双向链表模板 //=============================================================== //双向链表 //================================================================ #includeiostream #includefstream #includestring using namespace std; //----------------------------------------------------------------- templatetypename T class DoubleList; //----------------------------------------------------------------- templatetypename T class DoubleNode{ public: friend class DoubleListT; DoubleNode(T x); private: T data; DoubleNodeT *right, *left; };//------------------------------------------------------------------------- templatetypename T DoubleNodeT::DoubleNode(T x){ data=x; right=NULL; left=NULL; }//---------------------------------------------------------------------------- templatetypename T class DoubleList{ public: DoubleList(); ~DoubleList(); void Add(T x);//添加函数 bool IsEmpty()const;//判断是否为空 int Length() const;//返回长度函数 bool Find(int k,T x)const;//查找表中第k个元素是否存在，若存在则把它传到x中 int Search(T x)const;//在表中查找是否data=x的存在，若存在返回其位置 void Delete(int k, T x);//把表中的第k个元素删除链表，并不其值赋给x void Insert(int k, T x);//在表中第k个位置插入x void Display()const;//输出函数 void Clear();//清空函数 private: int length; DoubleNodeT *first; DoubleNodeT *last; };//--------------------------------------------------------------------------- templatetypename T DoubleListT::DoubleList(){ length=0; first=NULL; last=NULL; }//----------------------------------------------------------------------------- templatetypename T void DoubleListT::Insert(int k, T x){ if(k1 || klength+2) { cout不存在第k位置，进行元素的插入endl; return; } else { length++; DoubleNodeT *current=new DoubleNodeT(x); if(k==1) { current-right=first; first-left=current; current-left=last; last-right=current; first=current; } else if(k==length) //注意前面length加1了 { last-right=current; current-left=last; current-right=first; first-left=current; last=current; } else { // cout没进来？endl; Doubl