bool LIST :: deleteNode(){ NODE* tmp; if(p == head || p == tail) return false; tmp = p; p = p->getPre(); p->setNext(tmp->getNext()); p->getNext()->setPre(p); delete tmp; return true; }