درخت پیشوندی
Sign in to saveAlso known as digital tree, radix tree, prefix tree
thumb|250px|A trie for keys "A", "to", "tea", "ted", "ten", "i", "in", and "inn". Each complete English word has an arbitrary integer value associated with it.|alt=Depiction of a trie. Single empty circle, representing the root node, points to three children. The arrow to each child is marked by a different letter. The children themselves have similar sets of arrows and child nodes, with nodes that correspond to full words bearing blue integer values. In computer science, a trie (, ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and ret
Key facts
- Data structure.name
- Trie
- Data structure.invented_by
- Edward Fredkin, Axel Thue, and René de la Briandais
- Data structure.caption
- corresponds to length of the keys. corresponds to number of the keys.
- Data structure.invented_year
- 1960
- Data structure.type
- Tree
via Wikipedia infobox
Wikidata facts
- Subclass of
- search tree
- Has use
- string-searching algorithm
Show 3 more facts
- Commons category
- Trie
- different from
- tree
- studied by
- computer programming
Sources (2)
via Wikidata · CC0