A labeled ternary tree containing the labels 1 to n 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. The graph corresponding to the complete ternary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, 3].

complete binary tree | ternary tree