∥不带头结点 template <class Elem> bool NHList<Elem>::insert(const Elem& item)t if (head NULL head=cur〓tail=new Link<Elem>(item, NULL; else Link< Elem>* temp head ∥带头结点 if (temp = curr)t ea new template <class Elem> Link<Elem>(item, head); bool LList<Elem>::insert(const curr= head Elem& item)t fence->next= new Link<Elem>(item, fence->next); else t if (tail = fence) while(temp->next!= curr) temp temp->next; tail s fence->next temp->next= new righten++i Link<Elem>(item, curr)i return true: curr= temp->next righten++ return true back } exo 北京大学信息学院张铭编写 版权所有,转载或翻印必究 19北京大学信息学院 张铭编写 ©版权所有，转载或翻印必究 Page 19 back next // 带头结点 // 不带头结点 template<class Elem> bool NHList<Elem>::insert(const Elem& item) { if (head == NULL) head = curr = tail = new Link<Elem>(item, NULL); else { Link<Elem>* temp = head; if (temp == curr) { head = new Link<Elem>(item, head); curr = head; } else { while(temp->next != curr) temp = temp->next; temp->next = new Link<Elem>(item, curr); curr = temp->next; } } rightcnt++; return true; } template <class Elem> bool LList<Elem>::insert(const Elem& item) { fence->next = new Link<Elem>(item, fence->next); if (tail == fence) tail = fence->next; rightcnt++; return true; }