Call
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 repeatedly following references to either the left, mid or right child.
Ternary trees are used to implement Ternary search trees and Ternary heaps.
Talk Doctor Online in Bissoy App