Question

What is a 'linked list' and how does it differ from an array?

Q: Answer-What is a 'linked list' and how does it differ from an array?

Array advantages O1 random access by index, cache-friendly contiguous memory, simple implementation. Disadvantages fixed size static arrays, expensive insertiondeletion On shifting. Linked list advantages dynamic size, O1 insertiondeletion at head, no wasted memory. Disadvantages On access must traverse from head, extra memory for pointers, poor cache locality. Types of Linked Lists are Singly, Doubly, Circular, Doubly Circular linked lists. Linked lists are used in implementing stacks, queues, and hash table chaining.

A A linked list stores elements contiguously in memory like an array, but with faster access

B A linked list is used only for sorting the elements stored in the nodes; an array is used only for searching operations

C A linked list allows only sequential access; an array allows only random access

D A linked list has fixed size; an array can grow dynamically

E A linked list is a linear data structure where elements are stored at non-contiguous memory locations, each containing data and a pointer to the next node — unlike arrays which store elements in contiguous memory with direct index-based access

Practice Next