ternary search tree
Sign in to save3-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
Wikidata facts
- Instance of
- data structure
- Subclass of
- search tree
- Image
- Ternary Search Tree.png
Show 1 more fact
- P2579
- algorithmics
via Wikidata · CC0