search tree
data structure in tree form sorted for fast lookup
trie
ordered tree data structure that organizes nodes by common key prefixes
(a,b)-tree
type of balanced search tree
B-tree
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time
binary search tree
data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup
GiST
data structure
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