Memory Representation of a Linked List

Representation in memory of a Linked List

Let list be a linked list. Then list required to linear arrays called INFO and LINK. Such that INFO[k] and LINK[k] contain the information part & next pointer denoted by a NULL which indicates the end of the LIST.

Linked List Representation