A node is a struct or class object that has one or more member variables that are pointer variables. These nodes can be connected by their member pointer variables to produce data structures that can grow and shrink in size while your program is running.
A linked list is a list of nodes in which each node contains a pointer to the next node in the list.
The end of a linked list (or other linked data structure) is indicated by setting the pointer member variable equal to NULL or nullptr.
A stack is a first-in/last-out data structure. A stack can be implemented using a linked list.
A queue is a first-in/first-out data structure. A queue can be implemented using a linked list.