Nodes are pointers which point to other addresses right or they have some other function
In a single-linked list, each node contains pointer to the next node and either data, or pointer to data.
E.g. you have 3 elements in a list, where data stored is integers: 1, 2, 3.
So your node can look like this:
struct Node { Node* next; int data;};
And then 1st node's next will point to the second, and have 1 in data.
Second node's next point to the third node and have 2 in data. And the third's next have value that represents the end of the list (e.g. nullptr, or a pointer to some special end element), and data value of 3.