Vidyalelo
Data Structure · Q93

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 93

Q93

Which of the following is not true?

A.
Trie requires less storage space than hashing
Answer
B.
Trie allows listing of all the words with same prefix
C.
Tries are collision free
D.
Trie is also known as prefix tree

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board