A node stores its own data and a link to another node. In a linked list, each node points to the next, so you follow the links from the head instead of jumping directly to a position as you can with an array. section 1.4.2
Figure 1.4 Illustration of a linked list with four nodes. Each node has data and a pointer pointing to the next node. The start of the linked list is marked as head. The end of the linked list is identified if the next pointer is null.
Trace how each node’s pointer connects it to the next, from the head to the end of the list. section 1.4.2
A doubly linked-list node also points backward, allowing traversal in both directions at the cost of extra memory. In a tree, nodes form a hierarchy: a node can be a parent or child, and the top node is the root. section 1.4.2 section 1.4.4

