Untitled (8)

>    with(GraphTheory):with(SpecialGraphs):

>    G := CompleteBinaryTree(3);

G := `Graph 10: an undirected unweighted graph with 15 vertices and 14 edge(s)`

>    DrawGraph(G);

[Maple Plot]

>    DrawGraph(G,style=spring,dimension=3);

[Maple Plot]

¡@

Path Length of Binary Search Trees