balanced_tree#
- balanced_tree(r, h, create_using=None)[source]#
Returns the perfectly balanced
r
-ary tree of heighth
.- Parameters:
- rint
Branching factor of the tree; each node will have
r
children.- hint
Height of the tree.
- create_usingNetworkX graph constructor, optional (default=nx.Graph)
Graph type to create. If graph instance, then cleared before populated.
- Returns:
- GNetworkX graph
A balanced
r
-ary tree of heighth
.
Notes
This is the rooted tree where all leaves are at distance
h
from the root. The root has degreer
and all other internal nodes have degreer + 1
.Node labels are integers, starting from zero.
A balanced tree is also known as a complete r-ary tree.