Click here to hide categories Click here to show left categories

User: Home          welcome : Guest          Log In / Register here     




How can you represent Linear Linked List in memory

Memory Representation of Linear Linked List:

Let LIST is linear linked list. It needs two linear arrays for memory representation. Let these linear arrays are INFO and LINK. INFO[K] contains the information part and LINK[K] contains the next pointer field of node K. A variable START is used to store the location of the beginning of the LIST and NULL is used as next pointer sentinel which indicates the end of LIST. It is shown below:

Memory Representation of Linear Linked List

Share this article   |    Print    |    Article read by 13966 times
Author:
Rohit kakria
I am software developer, moderator of xpode.com
Related Articles:
Related Interview Questions: No related interview question