To represent this simple network with linked lists, we need to establish one set of pointers for each 1:N
relationship. In this example, that means one set of pointers to connect CUSTOMERs with their SHIP-
MENTs and another set of pointers to connect TRUCKs with their SHIPMENTs. Thus, a CUSTOMER record
will contain one pointer (to the first SHIPMENT it owns); a TRUCK record will contain one pointer (to the
first SHIPMENT it owns); and a SHIPMENT record will have two pointers, one for the next SHIPMENT
owned by the same CUSTOMER and one for the next SHIPMENT owned by the same TRUCK. This
scheme is illustrated in Figure H-27.