Front

A linked list is a user-defined data structure.

Back

True

Front

What are the components of a node object?

Back

data and reference

Front

In a singly linked list, the nodes have pointer to the previous nodes.

Back

False

Front

In creating a Node class, the obj.next is ____ by default.

Back

None

Front

What is the additional component that is added to a node on doubly linked lists?

Back

Previous Reference

Front

Why are insertion and deletion more efficient in linked lists compared to arrays?

Back

Because nodes are stored randomly, avoiding shifting.

Front

Why is the time complexity for accessing an element in a linked list O(n)?

Back

Because traversal is required to reach the element.

Front

In which scenario does searching for an element in a linked list have O(1) time complexity?

Back

When the element is at the head of the list.

Front

Evaluate

Back

True

Front

Back

False