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

Question

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.

Answer 1

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.

Comments

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.

---

try this http://en.wikipedia.org/wiki/Trie

---

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...