 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
In computer science, a Patricia trie is a simple form of compressed trie which merges single child nodes with their parents. Its name comes from the acronym PATRICIA, which stands for "Practical Algorithm to Retrieve Information Coded in Alphanumeric", and was described in a paper published in 1968 by Donald R. Morrison. Patricia tries are useful for constructing associative arrays with integer keys.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
