Ternary search tree
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include spell-checking and auto-completion.
Wikipage redirect
primaryTopic
Ternary search tree
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include spell-checking and auto-completion.
has abstract
Drzewo trójkowe (ternary searc ...... zastąpiona dodatkowym drzewem.
@pl
Em ciência da computação, um á ...... rtográfica e auto-complemento.
@pt
En informatique, un arbre tern ...... cherche et d'un arbre préfixe.
@fr
In computer science, a ternary ...... -checking and auto-completion.
@en
В інформатиці трійкове дерево ...... орфографії та автодоповнення.
@uk
三分探索木(さんぶんたんさくぎ、英: ternary sea ...... , "he" および "us" は一つのノードに圧縮できる。
@ja
三叉搜索树在计算机科学中是trie树或前缀树的一种实现,树的 ...... 了部分查找速度。三叉搜索树常用于实现拼写检查和自动完成功能。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,011,966,610
Link from a Wikipage to another Wikipage
delete avg
O
@en
delete worst
O
@en
insert avg
O
@en
insert worst
O
@en
name
Ternary Search Tree
@en
search avg
O
@en
search worst
O
@en
type
tree
@en
wikiPageUsesTemplate
hypernym
type
comment
Drzewo trójkowe (ternary searc ...... ęźle. Każdy indeks tablicy odp
@pl
Em ciência da computação, um á ...... rtográfica e auto-complemento.
@pt
En informatique, un arbre tern ...... cherche et d'un arbre préfixe.
@fr
In computer science, a ternary ...... -checking and auto-completion.
@en
В інформатиці трійкове дерево ...... орфографії та автодоповнення.
@uk
三分探索木(さんぶんたんさくぎ、英: ternary sea ...... 合の例を以下に示す(ここでは終端文字を # と表している)。
@ja
三叉搜索树在计算机科学中是trie树或前缀树的一种实现,树的 ...... 了部分查找速度。三叉搜索树常用于实现拼写检查和自动完成功能。
@zh
label
Arbre ternaire de recherche
@fr
Drzewo trójkowe
@pl
Ternary search tree
@en
Árvore ternária de busca
@pt
Трійкове дерево пошуку
@uk
三分探索木
@ja
三叉搜索树
@zh