数据结构第二章线性表..ppt

Type getData (return data ) ; void Firster ( ) { current = first; } int First ( ); int Next ( ); int Prior ( ); int operator ! ( ) { return current != NULL; } void Insert ( const Type value ); void Remove ( ); private: DblNodeType *first, *current; }; 搜索成功 搜索不成功 双向循环链表的搜索算法 template class Type int DblListType:: Find ( const Type target ) { //在双向循环链表中搜索含target的结点， //搜索成功返回1，否则返回0。 DblNodeType *p = first→rLink; while ( p != first p→data != target ) p = p→rLink; //循链搜索 if ( p != first ) { current = p; return 1; } return 0; } p→lLink = current; p→rLink =current→rLink; current→rLink = p; current = current→rLink; current→rLink→lLink = current; 双向循环链表的插入算法(在current后插入) p template class Type void DblListType:: Insert ( const Type value ) { if ( current == NULL ) //空表情形 current = first→rLink = new DblNode ( value, first, first ); else { //非空表情形 current→rLink =new DblNode ( value, current, current→rLink ); current = current→rLink; } current→rLink→lLink = current; } current→rLink→lLink = current→lLink; current→lLink→rLink = current→rLink; 双向循环链表的删除算法删除current指向的结点 template class Type void DblListType::Remove ( ) { if ( current != NULL ) { DblNode *temp = current; current = current→rLink; current→lLink = temp→lLink; temp→lLink→rLink = current; delete temp; if ( current == first ) if ( IsEmpty ( ) ) current = NULL; else current = current→rLink; } } 其他双向循环链表的公共操作 template class Type DblListType::DblLIst ( Type uniqueVal ) { //双向循环链表的构造函数, 创建表头结点 first = new DblNodeType ( uniqueVal ); first→rLink = first→lLink = first; current = NULL; } template class Type int DblListType::Length ( ) const { //求双向循环链表的长度(不计表头结点) DblNodeType * p = first→rLink; int count = 0; while ( p != first )