Tries are some kind of rooted trees in which each edge has a character on it. For a bunch of strings, their trie is the smallest rooted tree with a character on each edge and each of these strings can be build by writing down the characters in the path from the root to some node.
Read full article from Tries Tutorial | Commonlounge
No comments:
Post a Comment