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:




Share this article \| Print \| Article read by 26869 times
Author: Rohit kakria I am software developer, moderator of xpode.com	Related Articles: Where Sequential Allocation Method is not accep... What is the difference between Sequential Alloc... What is Linked List? What are its different typ... Explain different types of linked lists.... What is the difference between Linked List and ... What is Linear Linked List... What are Advantages and Dis-advantages of Linea... What do mean by Availability List or AVAIL List... What do you mean by- (a) Memory Allocation (b) ... What do you mean by Static and Dynamic Storage ... Related Interview Questions: No related interview question