About this document
Understanding Tries and Suffix Tries by nemonizer is a document available to read on EtoBox.
A trie is a tree-like data structure used to store strings. It stores strings by splitting them into individual characters and storing each character as a node. Common applications include spell checking, data compression, and storing XML documents. A suffix trie is a specific type of trie that stores all suffixes of a given string or set of strings.
- Author
- nemonizer
- Language
- EN