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
Facts
4 properties- Instance of
- data structure
- Subclass of
- ternary tree, search tree[2][3]
- Has characteristic
- space saving[4]
- Studied by
- algorithmics[5]
🏷️ Also known as
en ternary search tree
en TST
fa درخت جستجوی سهتایی
fi ternäärinen hakupuu
fr arbre ternaire de recherche
it albero ternario di ricerca
ja 三分探索木
ko 삼항 탐색 트리
pl Drzewo trójkowe
pt Árvore ternária de busca
th ต้นไม้ค้นหาไตรภาค
uk Трійкове дерево пошуку
zh 三元搜索树
zh-hant 三元搜尋樹
🔖 Identifiers · 5
- OpenAlex ID
- C136519935
- Image (Wikimedia Commons)
- Ternary Search Tree.png ↗
- Dictionary of Algorithms and Data Structures ID
- ternarySearchTree, tst
- Freebase ID
- /m/08ldlz
- Microsoft Academic ID (discontinued)
- 136519935
Press Enter · cited answer in seconds
0 sources
Summary
ternary search tree is a data structure[1].