Freeing the dynamic memory allocated in the Linked list

Code:

---

#include<stdio.h>
#include<conio.h>
#include<string.h>
#include<stdlib.h>

struct node
{
    int data;
    int data2;
    struct node *link;
};

void addatbeg(struct node **q,int num,int num2)
{
    struct node *temp;

    temp=(struct node *)malloc(sizeof(struct node));
    temp->data=num;
    temp->data2=num2;
    temp->link=*q;
    *q=temp;
   
}

void display (struct node *q)
{
    while(q!=0)
    {
        printf("%d\t %d\t",q->data,q->data2);
        q=q->link;
    }
    printf("\n");
}

void main()
{
  struct node *p;
  p=NULL;

  addatbeg(&p,123,43);
  display(p)  ;
  addatbeg(&p,97,47);
  display(p);

}

---

I want to ask what memory should I free ? The linked list or just the pointer p ?
And after the execution of the program is done,ie I exit the IDE is the dynamically allocated memory still in use ? Same for the Pointer.

I have not been able to figure out what to free, but I assume we use the free() function for it.

Thanks

Yes the free functions should be used.You should free what you have allocated dynamically(with malloc for example).So you have to free where the pointer points to .The pointer itself will be deallocated when the program is finished.
I think that when the program terminates the dynamically allocated memory is going to be deallocated.

All pointers returned by malloc must be passed to free to free the memory.
The operating system will typically clean up your memory leaks when the program terminates, but don't rely on this: it is considered bad practice.

To free the memory they point to!!! The pointers are not deallocated until the program is terminated.
And keep in mind that if you have a large program and do not free your dynamically allocated memory then your heap may be become full!So it is your responsibility to deallocate memory when you do not need it ,in order to re-use it again ;)

When you are in main(), p is a pointer which is always pointing to the first(head) node. If you call free() for only p then only first node will be deallocated and not rest. It leads to memory leak. You can imagine a train without engine :)
If you want to destroy the complete linked list then traverse each node to free().

Hey thanks everyone. I need some advice with coding.
I've just started working with Data Structures using C. Should I do C++ first and then do data struct or do data structure and then C++.
I'm confused & looking for what to do next after C. I did C last semester and I don't know any other prog lang. What should I try doing next ?
Open to all suggestions

i have the exact same ques as surajkaul w,r,t to coding. except i was considering Java instead of C++.....advice from the programming experts wud be really appreciated!!!

Also any book recommendations for jumping into C++ from C & for Data Struct likewise.