DataStructures / Data structures Interview questions
Explain trie data structure.
Trie is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated.
An trie is also called digital tree, radix tree or prefix tree.
More Related questions...