delete item from linked list

I have written the below code to remove a node from a single linked list. Now need some help to get farther. What am I missing?
[code]
int deleteItem(struct node** headRef, int item)
{
struct node* current = *headRef;
struct node* tmp;
int count = 0;
if(current == NULL)
return 1;
if((item-1) == 0)
{
tmp = current->next;
free(current);
*headRef = tmp;
}
else
{
while(count < item-1)
{
tmp = current->next->next;
current = current->next;
free(current);
*headRef = tmp->next;
count++;
}
}
return 0;
}

Code:

---

int deleteItem(struct node** headRef, int item)
{
  struct node* current = *headRef;
  struct node* tmp;
  int count = 0;
  if(current == NULL)
      return 1;
  if((item-1) == 0)
  {
      tmp = current->next;
      free(current);
      *headRef = tmp;
  }
  else
  {
      while(count < item-1)
      {
        tmp = current->next->next;
        current = current->next;
        free(current);
        *headRef = tmp->next;
        count++;
      }
  }
  return 0;
}

---

I think you should compare items instead of counting like you do. Something like this

Code:

---

int deleteItem(struct node **headRef, int item)
{
  struct node *current = *headRef;
  struct node *tmp;

  if (current == NULL) /* No list */
    return 1;
  else if (current->item == item) /* Delete first */
  {
    tmp = current;
    *headRef = current->next;
    free(tmp);
  }
  else
  {
    while (current->next != NULL)
    {
      if (current->next->item == item)
        break;

      current = current->next;
    }

    tmp = current->next;
    current->next = current->next->next;
    free(tmp;
  }

  return 0;
}

---

I think that would do it, single linked lists are funky. ;)

You need to make sure your code works for deletion at the beginning, middle and end of an SLL.