ternary tree (Q7263850)
tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"
Language:
other details
aliases 3-ary tree
description tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"

External Links
(P646) /m/05mtvhw
(P2581) 01451512n
(P6366) 22550940