Linked List

Choose difficulty:

Beginner

Intermediate

Advanced

1. What are the advantages of a doubly linked list?

a: The memory required for a doubly linked list is less than a linked list Explanation

Explanation

b: Doubly linked list allows for traversing both sides. Explanation

Explanation

c: Inserting an element is faster in a doubly linked list. Explanation

Explanation

d: There is no advantage. Explanation

Explanation

2. What is the time complexity for insertion of an element into a doubly linked list (at a known position)?

a: O(1) Explanation

Explanation

b: O(log n) Explanation

Explanation

c: O(n) Explanation

Explanation

d: O(n^2) Explanation

Explanation

3. Which of the following can make deletion in a doubly linked list a constant time operation?

a: Keeping the doubly linked list sorted Explanation

Explanation

b: Having a pointer at both the first and last element Explanation

Explanation

c: Having the pointer of the node to be deleted Explanation

Explanation

d: Knowing the position of the node Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)