数据结构(殷人昆) 线性表课堂讲义.ppt

双向循环链表的搜索算法 搜索成功 搜索不成功 first first 31 31 48 48 15 15 57 57 搜索15 ? ? ? 搜索25 ? ? ? ? 双向循环链表的搜索算法 template class T DblNodeT *DblListT::Search ( T x , int d ) { //在双向循环链表中寻找其值等于x的结点。 DblNodeT *current = (d == 0)? first-lLink : first-rLink; //按d确定搜索方向 while ( current != first current-data != x ) current = (d == 0) ? current-lLink : current-rLink; if ( current != first ) return current; //搜索成功 else return NULL; //搜索失败 }; 双向循环链表的插入算法 (非空表) newNode-rLink = current-rLink; current-rLink = newNode; newNode-rLink-lLink = newNode; newNode-lLink = current; first first 31 48 15 后插入25 current newNode 31 48 25 15 current 双向循环链表的插入算法 (空表) first 后插入25 current newNode 25 first current newNode-rLink = current-rLink (newNode-rLink = first); current-rLink = newNode; newNode-rLink -lLink = newNode; ( first-lLink = newNode ) newNode-lLink = current; 双向循环链表的插入算法 template class T bool DblListT::Insert ( int i, T x, int d ) { //建立一个包含有值x的新结点, 并将其按 d 指定的 //方向插入到第i个结点之后。 DblNodeT *current = Locate(i, d); //按d指示方向查找第i个结点 if ( current == NULL ) return false; //插入失败 DblNodeT *newNd = new DblNodeT(x); if (d == 0) { //前驱方向:插在第i个结点左侧 newNd-lLink = current-lLink; //链入lLink链 current-lLink = newNd; newNd-lLink-rLink = newNd; //链入rLink链 newNd-rLink = current; } else { //后继方向:插在第i个结点后面 newNd-rLink = current-rLink; //链入rLink链 current-rLink = newNd; newNd-rLink-lLink = newNd; //链入lLink链 newNd-lLink = current; } return true; //插入成功 }; 删除48 双向循环链表的删除算法 first first 非空表 31 48 15 current 31 15 current current-rLink-lLink = current-lLink; current-lLink-rLink = current-rLink; 双向循环链表的删除算法 template class T bool DblListT::Remove( int i, T x, int d ) { //在双向循环链表中按d所指方向删除第i个结点。 DblNodeT *current = Locate (i, d); if (current == NULL) return false; //删除失败 current-rLink-lLink = current-lLink; current-lLink-rLink = current-rL