ternary tree
tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"
en-US/ˈtɝnəɹi ˈtɹi/
en-GB/ˈtɜːnəɹɪ ˈtɹiː/
tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"