+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the advantage of using a doubly linked list for chaining over singly linked list?

(a) it takes less memory

(b) it is easy to implement

(c) it makes the process of insertion and deletion faster

(d) it causes less collisions

This interesting question is from Hash Tables in chapter Hash Tables of Data Structures & Algorithms I

I had been asked this question during an online interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct option is (c) it makes the process of insertion and deletion faster

Easiest explanation - Using a doubly linked list reduces time complexity significantly. Though it uses more memory to store the extra pointer.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...