Algoritma menghapus elemen genap pada linklist

1.  Algoritma menghapus elemen genap pada linklist

Procedure hapus genap(output currP)

Deskripsi :

  bool List::deleteIter(ItemType item)

  { 

    Node *currP, *prevP;

  prevP = NULL;

for i <- 0 to n do 

if (n/2==0)

for (currP = link;

       currP != NULL;

       prevP = currP, currP = currP->getNext()) {

    if (currP->getData() == item) {  /* Found it. */

      if (prevP == NULL) {

        link = currP->getNext();

      } else {

        prevP->setNext(currP->getNext());

      }

      delete currP;  

      return true;       }

  }