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

(a) it takes less memory

(b) it causes more collisions

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

(d) it causes less collisions

The query is from Hash Tables topic in division Hash Tables of Data Structures & Algorithms I

The question was posed to me in homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (a) it takes less memory

Easy explanation - Singly linked list takes lesser space as compared to doubly linked list. But the time complexity of the singly linked list is more than a doubly linked list.

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

...