Finding Linked Lists size

[HG319]

I need to find the size of a linked list recursively and iteratively
Here is what I have for each
Do these look okay?

 int GetCurrentSize(node* p)
{
        if (p==NULL)
                return 0;
        else{
             return 1 + GetCurrentSize(p->next_node);
             }

}

int GetCurrentSize(node* cur){
    int count;
    while(cur != NULL){     
        cur->next_node;
        count++
        }
return count;
}

[GRex2595]

They look fine. Do they work? You may have to verify that they work.

If you write any sort of linked list class or struct yourself, you should probably manually keep track of size. That way when you are asked what size it is, you can give the answer immediately rather than trying to find out yourself.