Question

Is this possible? Or is there gonna be a lost list? Cause I can’t check if its working or not

void FreeRecurs(struct nodeTag *pFirst)
{
    if(pFirst != NULL)
    {   
            FreeRecurs(pFirst -> pNext);
            free(pFirst);
    }
}

Answer 1

That will work, but on long lists, you may get a stack overflow because you’re recursing a lot and are not using tail recursion. I’d move to an iterative version:

• While the current node is not NULL:
  • Store a pointer to the next node.
  • Free the current node.
  • Start working on the next node using the pointer you stored just before freeing.