Joined October 2018

This article is about rooted trees with three children per node. For unrooted trees with three neighbors per node, see unrooted binary tree.A simple ternary tree of size 10 and height 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 , if it exists. Any node in the data structure can be reached by starting at root node and re…
Visit on Tumblr (legacy)