Question

Which of the following statements about linked lists is true?

• A. Elements of a linked list are stored in contiguous memory locations.
• B. Accessing the $n^{th}$ element of a linked list takes $O(1)$ time.
• C. In a singly linked list, each node contains a data part and a pointer to the next node.
• D. A linked list cannot be dynamically resized.

Hint:

While Linked Lists have slower access times ($O(n)$) compared to Arrays ($O(1)$), they are much more efficient at insertions and deletions ($O(1)$ if you have the pointer) because no shifting of elements is required.

Answer 1

The Correct Option is C