A good answer might be:

The address of the successor node.

Linked List Nodes

The previous chapter implemented linked lists using static memory and symbolic addresses. For example, here is some code and a picture of what it does:

          .data
elmnt01:  .word  1
          .word  elmnt02

elmnt02:  .word  2
          .word  0
       

Each node contains an integer followed by an address.

QUESTION 3:

How many bytes are needed for each node?