数据结构英文教学课件：Linked List-exercise.pptVIP

Data Structure Software College Northeastern University Linked list 问题：在一个有序表中插入一个数据元素 Sequence List Solutions Programming Exercise int SeqListType::Insert_sorted(Type value) 插入成功时返回0 表内有相同的数据元素时插入失败返回1 template class Type int SeqListType::Insert_sorted( Type value) { i=0; while(i = last data[i] value) i++; if( i=last data[i] == value || last ==MaxSize-1) return 1; for(j=last;ji-1;j--) data[j+1]=data[j]; data[i]= value; last++; return 0; } Programming Exercise int List::Insert_sorted(Type value) 插入成功时返回0 表内有相同的数据元素时插入失败返回1 Template of linked list(1) template class Type class List; template class Type class ListNode { friend class ListType; Type data; //结点数据 ListNodeType *link; //结点链接指针 public: ListNode ( ); //链表结点构造函数 ListNode ( const Type item ); ListNodeType *NextNode ( ) { return link; } //给出当前结点的下一结点地址 } Linked List Solutions template class Type int ListType::Insert_sorted( Type value) { ListNodeType *pre =first,*p=first-link; while(p != NULL p-data value ) { pre = p; p = p-link; } if( p != NULL p-data == value) return 1; q = new ListNodeType( value ); q-link = pre-link; pre-link = q; return 0; } Programming Exercise int List::If_sorted() 如果是有序的返回0 如果是无序的返回1 Linked List Solutions template class Type int ListType::If_sorted( Type value) { ListNodeType *pre =first-link,*p; while(pre != NULL) { p = pre-link; if(p == NULL ) return 0; else if (pre-data p-data) return 1; else pre = p; } return 0; } Programming Exercise void List::Delete_Same() 链表中的数据元素按照元素值由大到小存储，去掉表中数值相同的数据元素 Linked List Solutions template class Type void ListType::delete_same( Type value) { ListNodeType *p =first-link