Question

Describe an application or a situation in which it is not convenient to use a linked list to store the data of the application

Answer 1

Answer:

A linked list is a linear data structure. In which elements are not stored at contiguous memory location. The element in a linked list using pointers.

Explanation:

"It is not convenient in case of more memory use than array because pointer storage, second it is incontiguous so it increased time period required to access individual element within the list, specially CPU cache. Third problem is that when we reverse traversing linked list."