Trie
In computer science, a trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the trie is traversed depth-first, following the links between nodes, which represent each character in the key.
known for
Wikipage disambiguates
Wikipage redirect
Aho–Corasick algorithmApproximate string matchingAssociation rule learningAssociative arrayB-trieBinary search algorithmBit arrayBitwise triesBloom filterBrookline,_MassachusettsBurstsortC-trieC dynamic memory allocationCardinal treeCompressing triesCounts of DreuxDedekind–MacNeille completionDeterministic acyclic finite state automatonDeterministic finite automatonDigital treeDirected acyclic graphDocument-term matrixEdward FredkinExtendible hashingFeature hashingFuss–Catalan numberGADDAGGiSTHash array mapped trieHash tableHash tree (persistent data structure)Hash trieInaros IIInteger sortingJohn I, Count of DammartinKademliaLZ77 and LZ78LarocqueLevenshtein automatonList of algorithms
Link from a Wikipage to another Wikipage
data
hypernym
primaryTopic
Trie
In computer science, a trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the trie is traversed depth-first, following the links between nodes, which represent each character in the key.
has abstract
Drzewo trie (wym. tri od ang. ...... ą liczbę koniecznych porównań.
@pl
Em ciência da computação, uma ...... em uma lista de dígitos, etc.
@pt
En informatique, un ou une tri ...... nifiant extraction, recherche.
@fr
In computer science, a trie, a ...... an integer or memory address.
@en
In informatica, un trie (pronu ...... initi deterministico aciclico.
@it
Introducidos en 1959 independi ...... adenas que comparten prefijos.
@es
Trie nebo prefixový strom je d ...... ermutace na seznamu tvarů atd.
@cs
Un trie és un cas especial d'a ...... ix del terme anglés retrieval.
@ca
Префиксное дерево (также бор, ...... но, некоторые внутренние узлы.
@ru
Префіксне дерево (англ. trie, ...... , деякими внутрішніми вузлами.
@uk
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,024,044,812
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
Drzewo trie (wym. tri od ang. ...... alizować za pomocą drzew trie:
@pl
Em ciência da computação, uma ...... á-lo do termo mais geral tree.
@pt
En informatique, un ou une tri ...... nifiant extraction, recherche.
@fr
In computer science, a trie, a ...... ent each character in the key.
@en
In informatica, un trie (pronu ...... iamente tutti, i nodi interni.
@it
Introducidos en 1959 independi ...... s búsquedas en un diccionario:
@es
Trie nebo prefixový strom je d ...... uzly, které odpovídají klíčům.
@cs
Un trie és un cas especial d'a ...... ix del terme anglés retrieval.
@ca
Префиксное дерево (также бор, ...... ь все узлы дерева выделенными.
@ru
Префіксне дерево (англ. trie, ...... ореня довжиною цього префікса.
@uk
label
Drzewo trie
@pl
Trie (informatique)
@fr
Trie
@ca
Trie
@cs
Trie
@de
Trie
@en
Trie
@es
Trie
@it
Trie
@pt
Trie
@zh