Explain why linked lists do not face an overflow situation as in the case of array based data structures.

6 views

1 Answers

The linked list follows the dynamic data structure method. It grows and shrinks as and when the new items are added and removed respectively. Not only that an array requires contiguous memory but a linked list not require contiguous memory rather it uses scattered memory and they linked by pointers. So an element in a linked list consists of data and an address it is called a node. Here address is the link.

6 views

Related Questions