Question

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.

Answer 1

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.