LinkedListTest

void remove(int x)
{
    node *p=top;
    node *q=NULL;
    while(p!=NULL)
    {
        if(p->data==x)
            q=p;

        p=p->next;
    }
    removeNode(q);
}

void removeNode(node* target){
  if(target==top)
      removeFront();
      
  else if(target==bottom)
      removeBack();
  
  //some node in between
  else
  {
      target->prev->next=target->next;
      target->next->prev=target->prev;
      delete target;
  }
}

void tricmate()
{
    int counter = 1;
    node* current = top;
    node* next;
    while(current != NULL){
        next = current->next;       //save next node
        
        //third element found
        if(counter == 3){
            counter = 0;            //reset counter
            removeNode(current);
        }
        current = next;
        counter++;
    }
}