A must-know for anyone heading into a linked list interview, this question is frequently asked in linked list interview questions for experienced. A linked list is a dynamic data structure, so at a point in time, you can change its size by adding or removing elements from it. Also, every element in a linked list is stored at random positions, and each element has a node and a reference to be stored in the memory. So, linked lists have a requirement for dynamic memory, and therefore for a linked list, memory is allocated from the heap section, which is like a free memory bank, and whenever a node is required to be created, the program you write asks from the memory manager to provide a free space after this there is a garbage collector which is used to collected deleted nodes, and hence this data structure is also called a dynamic data structure. There are memory spaces where the pointers are stored and are called AVAIL, which is a list of memory locations.