k-ary tree
tree data structure in which each node has at most k children
ternary tree
tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"
binary tree
tree data structure in which each node has at most two children