Tries : Basics Tries are data structure which are usually neglected by programmer while designing solutions. Tries are very useful in cases where strings are involve with good amount of duplication of their prefixes. Trie is a data structure which stores information, referred to as key, in such a manner that the common information is stored only once. Usually keys are strings. No node in trie stores the whole key, but the position of the node gives us information that which key it is part of. All the descendant node in trie have the same prefix, hence trie is also know as prefix trees.
Read full article from Algorithms and Me: Tries : Basics
No comments:
Post a Comment