+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following is not true?

(a) Trie requires less storage space than hashing

(b) Trie allows listing of all the words with same prefix

(c) Tries are collision free

(d) Trie is also known as prefix tree

Question is taken from Trie topic in division Trie of Data Structures & Algorithms I

I had been asked this question in an online quiz.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (a) Trie requires less storage space than hashing

Easiest explanation - Both the hashing and the trie provides searching in the linear time. But trie requires extra space for storage and it is collision free. And trie allows finding all the strings with same prefix, so it is also called prefix tree.

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

...