ternary search tree (Q2859802)
Jump to navigation
Jump to search
3-way tree data structure where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key
- TST
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ternary search tree |
3-way tree data structure where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key |
|
Statements
Identifiers
1 reference
Sitelinks
Wikipedia(11 entries)
- enwiki Ternary search tree
- fawiki درخت جستجوی سهتایی
- frwiki Arbre ternaire de recherche
- jawiki 三分探索木
- kowiki 삼항 탐색 트리
- plwiki Drzewo trójkowe
- ptwiki Árvore ternária de busca
- srwiki Tercijarna stabla pretrage
- thwiki ต้นไม้ค้นหาไตรภาค
- ukwiki Трійкове дерево пошуку
- zhwiki 三叉搜索树