Complete Tree

Download Wolfram Notebook

A complete tree is a graph corresponding to a complete -ary tree on nodes.

Complete trees are implemented in the Wolfram Language as KaryTree[n, k], and complete -ary trees are implemented as CompleteKaryTree.

See also

Complete Binary Tree, Complete Ternary Tree

Explore with Wolfram|Alpha

More things to try:

References

House of Graphs. Complete Trees. Claw Graph (K1,3), T3,2,3, Complete Binary Tree, height 3 (4 rows, 15 vertices), Complete Binary Tree, height 4 (5 rows, 31 vertices), complete ternary tree of depth 3, Complete Ternary Tree, height 3 (4 rows, 40 vertices), Complete Ternary Tree, height 4 (5 rows, 121 vertices), Complete 4-ary Tree, height 2 (3 rows, 21 vertices), Complete 4-ary Tree, height 3 (4 rows, 85 vertices), P3 = K1,2, Singleton Graph, Star K1,4, K1,5, Star K1,6, K1,7, K1,8, K1,9, K1,10, K1,11, 13-star graph, 14-star graph, 15-star graph, 16-star graph, 17-star graph, 18-star graph, 19-star graph, and 20-star graph.

Referenced on Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Complete Tree." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CompleteTree.html

Subject classifications