toIPA
Home
Blog
Category
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
Pronunciation
/ˈtəːnəri səːʧ triː/
/ˈtərnəri sərʧ tri/
Categories
data structure
search tree
ternary tree