top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Which data structure is best for english words dictionary and why ??

+1 vote
Which data structure is best for english words dictionary and why ??
posted Oct 17, 2013 by Vikas Upadhyay

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

Trie is usually used to implement dictionary since the complexity of finding a particular word from given dictionary words is O(L) where L is the length of the word.

answer Oct 17, 2013 by anonymous
In that case each node can have 26 child node, am I right?
Thanks for this nice answer :) :)
which tree ?
AVT tree
RB tree
m-ary tree
B++ tree
trie tree
Binary threaded tree.
Trie is the best implementation of a dictionary in terms of long DB of words and searching them
ya, each char wil pointing 26 and so on...
Similar Questions
+4 votes

Give a good data structure for having n queues (n not fixed) in a finite memory segment. You can
have some data-structure separate for each queue. Try to use at least 90% of the memory space.

+1 vote

Which data structure will be best for storing very large numbers (for example a number having 10^3 digits). Additionally, I want to perform comparison operation on them..

+4 votes

Given a dictionary of strings and another string find out if the string is an exact match to some words in the dictionary or varies at most in only one place of some word of the dictionary?

+1 vote

Given a string and dictionary of words, form a word by removing minimum number of characters.
Characters can be removed in-order only.