Ternary tree

In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left, mid or right child.

单词	Ternary tree
释义	Ternary tree 英语百科 Ternary tree In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left, mid or right child.
随便看	surdimute surdimutism surdimutitas surdine surdiny sur disclaimer surdism surditas surditas congenita surditas functionalis surditas organica surditas verbalis surditas verbalisi surdity surd number surdocardiac syndrome surdomute Surdomutism surdomutitas surdon surdorum mutitas surd root surds with same order Surduc Surduc, Pasul