Why a linked list is called a dynamic data structure? What are the advantages of using linked list over arrays?
A linked list is known as a dynamic data structure because it can be used with a data collection that grows and shrinks during program implementation. The main advantage of using linked list over arrays is in executing any data structure like stack or queue. The arrays are set in size and so a lot of memory gets wasted if we declare in prior the estimated size and the used space is less. Also it is not time efficient to perform deletion, insertion and updating of information in an array execution because of its fixed length memory storage.