Explain how memory is represented in a linked list data structure?

Answer 1

Type your answer here...  Let lists be a linked. Then list will be maintained in memory unless otherwise specified or implied as follows. First of all list required two liner array we will call them here INFO and LINK such that INFO[K] and LINK[K] contain, respectively, the information part and the next pointer filed of a node of list.

 As noted above list also required a variable name such as start which will contain the location of the beginning of the lists and the next pointer sentinel denoted as null which indicates the end of the lists

 Since the subscripts of the array INFO and LINK will usually be positive, we will chose null otherwise started.

Answer 2

A linked list consists of nodes connected together. Consider a link list node:

struct node{

int data;

struct node *next;

};

The nodes of the linked list will be allotted chunks of memory in random. Each memory chunk will be of the size node(= sizeof(node)). The actual content(data) will be stored in the data element of the node. The next pointer will store the starting address of the next node. Hence using this pointer value, we can traverse through the list. If there is no next node, then it is made to point to NULL. Hence in linked list, the memory chunks need not be in contiguous locations and can be allotted int random locations.