construct complete binary tree
construct complete k-ary tree
positive integer indicating the degree of the root
positive integer indicating the depth of the tree
The CompleteBinaryTree(n) command constructs the complete binary tree with depth n.
The CompleteKaryTree(k,n) command constructs the complete k-ary tree with depth n for a given k.
G≔Graph 1: an undirected unweighted graph with 7 vertices and 6 edge(s)
H≔Graph 2: an undirected unweighted graph with 13 vertices and 12 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)