Linked list node class definition:
1Template <classT>2 classsinglelist;3Template <classT>4 classNode5 {6 Private:7 T element;8Node<t> *link;9FriendclassSinglelist<t>;Ten};
Linked List class definition:
1Template <classT>2 classSinglelist: PublicLinearlist<t>3 {4 Public:5 singlelist ()6 {7First =NULL;8n =0;9 }Ten~singlelist (); One BOOLSm_delete (T x); A Private: -node<t>*First ; -};
To delete a member function for a specific element x:
Method One:
1template<classT>2 BOOLSinglelist<t>:: Sm_delete (T x)3 {4Node<t> *p;5 intj =0;6p =First ;7 while(P)8 {9 for(j =0; P&&p->element! = x; J + +)Tenp = p->link; One if(P) A { - Delete (j); -p =First ; the } - Else - return false; - } + return true; -}
Method Two:
1template<classT>2 BOOLSinglelist<t>:: Sm_delete (T x)3 {4 for(node<t>** cur = &first; *cur;)5 {6node<t>* Entry = *cur;7 if(Entryement = =x)8 {9*cur = entry->link;Ten Free(entry); One } A Else -Cur = &entry->link; - } the}
Data structure-linked list implementation Delete all specific elements x