Examples for

# Regular Trees

Regular k-ary trees are balanced trees whose vertices have k children each. Binary trees and ternary trees are examples of k-ary trees, with k=2 and k=3 respectively. Wolfram|Alpha has the power to generate and compute the properties of these trees.

Generate regular k-ary trees by specifying the number of levels and/or the number of children per node.