A labeled ternary tree containing the labels 1 to with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, and so on (Knuth 1997, p. 401). The graph corresponding to the complete ternary tree on nodes is implemented in the Wolfram Language as KaryTree[n, 3].
Complete Ternary Tree
See also
Complete Binary Tree, Complete Tree, Ternary TreeExplore with Wolfram|Alpha
References
Knuth, D. E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd ed. Reading, MA: Addison-Wesley, 1997.Referenced on Wolfram|Alpha
Complete Ternary TreeCite this as:
Weisstein, Eric W. "Complete Ternary Tree." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CompleteTernaryTree.html