Representation Of Linked Lists In Memory

Representation Of  Linked Lists In Memory:   Let LIST be a linked list. Then LIST will be maintained in memory, unless otherwise specified or implied, as follows. First of all,  LIST requires two linear array- we will call them here INFO and LINK-such that INFO[K] and LINK[K] contain, respectively, the information part and the nextpointer field of a node of LIST.LIST also requires a variable name-such as START-which contains the locations of the beginning of the list, and a nextpointer sentinel denoted by NULL-which indicates the end of the list. The arrays INFO and LINK will usually be positive, we will choose NULL = 0, unless otherwise stated.

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE