# 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

**Wikidata**: [Q2859802](https://www.wikidata.org/wiki/Q2859802)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Ternary_search_tree)  
**Source**: https://4ort.xyz/entity/ternary-search-tree


## References

1. Freebase Data Dumps. 2013
2. [OpenAlex](https://docs.openalex.org/download-snapshot/snapshot-data-format)