Of course.
When
a dynamic data structure is constructed, it
is common to have a field in main memory that points to
the start of the structure.
The picture shows this.
The symbolic address first
contains the
address of (points to) the first node of the linked list.
Sometimes a field like this is called a header
to the linked list.
(Note: the first node is called the head, the field that points to it is called the header. Unfortunately people are not consistent about this.)
Now the address of the first node is contained in two places (both colored red). Here is the code that does this:
Fill in the blanks to complete the code.