3-3线性表-双向循环链表.pptVIP

双向链表 一、作用：方便定位一个结点的前驱结点和后继结点 二、结点的形式 ai 三、p95 程序3-21 双向链表 a2 a3 a1 LeftEnd RightEnd a2 a3 a1 L Length templateclass T int DoubleT::Length() const { int len = 0; DoubleNodeT *current = RightEnd; while(current){ current = current-left; len++; } return len; } Length templateclass T int DoubleT::Length() const { int len = 0; DoubleNodeT *current = LeftEnd; while(current){ current = current-right; len++; } return len; } Insert ai-1 ai e s-right = p-right; s-left = p; p-right = s; s-right-left=s; p s ai-1 ai Delete ai-1 ai ai+1 p-right = q-right; q-right-left = p; p ai-1 q q=p-right; 双向循环链表 LeftEnd RightEnd a2 a3 a1 LeftEnd RightEnd first 间接寻址链表 a1 a2 a3 table a1 a2 a3 间接寻址链表 template class T class IndirectList { public: IndirectList(int MaxListSize = 10); virtual ~IndirectList(); bool IsEmpty()const {return length == 0;} int Length() const {return length;} bool Find(int k, T x); int Search(T x)const; IndirectListT Delete(int k, T x); IndirectListT Insert(int k, const T x); void Output(std::ostream out) const; private: T ** table; int length, MaxSize; }; 构造函数 templateclass T IndirectListT::IndirectList(int MaxListSize) { MaxSize = MaxListSize; length = 0; table = new T*[MaxSize]; } table a1 a2 a3 释构函数 templateclass T IndirectListT::~IndirectList() { for(int i = 0; i length; i++) delete table[i]; delete [] table; } Insert函数 templateclass T IndirectListT IndirectListT::Insert(int k, const T x){ if(k 0 || k length) throw OutOfBounds(); if(length == MaxSize)throw Nomem(); for(int i = length - 1; i = k; i--) table[i + 1] = table[i]; table[k] = new T; *table[k] = x; length++; return *this; } Delete函数 templateclass T IndirectListT IndirectListT::Delete(int k, T x){ if(k 1 || length k) throw OutOfBounds(); x = *table[k - 1]; delete table[k]; for(int i = k; i length; i++) table [i - 1] = table [i]; length--; return *this; } RightEnd 和结点的left指针构成了一个单向链表 LeftEnd 和right指针构成了另外一个单向链表