A linked list stores each value in its own heap node, and each node points to the next one; the last points to NULL. The list is just a pointer to the first node, the head. Adding at the front is cheap: make a node whose next is the old head, and it becomes the new head.
Walking the list uses a pointer that moves along the links: for (p = head; p != NULL; p = p->next). There are no indexes, so reaching the tenth element means following ten links, and nodes are scattered in memory, which is slow for the cache compared with an array.
Freeing needs care: save p->next before calling free(p), because reading a node after freeing it is undefined behavior.
The new node points at the old head and becomes the head.