带头节点的单链表删除 - c++

struct node{
    int data;
    node *next;                     
};

bool eraseLLHeadnode(node *head,int pos){
     if(pos < 0)
            return false;
     node *p = head;
     int j = 0;
     while(j < pos && p){
             j++;
             p = p->next;
     }
     if(!p || !p->next)
           return false;
     node *q = p->next;
     p->next = q->next;
     delete q;
     return true;
}