+1 vote
in Data Structures & Algorithms I by (88.2k points)
Trie is also known as _________

(a) Digital Tree

(b) Treap

(c) Binomial Tree

(d) 2-3 Tree

I want to ask this question from Trie topic in chapter Trie of Data Structures & Algorithms I

This question was addressed to me in a job interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct choice is (a) Digital Tree

Best explanation: Trie is a very useful data structure which is based on the prefix of a string. Trie is used to represent the “Retrieval” of data and thus the name Trie. And it is also known as a digital 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.