In a linked list, what is the time complexity of accessing an element by its index?

Answer:

Explanation:

Accessing an element by its index in a linked list takes O(n) time because linked lists do not provide direct access to elements. To access the i-th element, you need to traverse the list from the head node, which requires linear time.

This is in contrast to arrays, which allow O(1) access to elements by their index. However, linked lists are more efficient than arrays for insertions and deletions, especially at the beginning or middle of the list.

Linked lists are often used when dynamic memory allocation and frequent insertions and deletions are required.