The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $$h$$ is:

Let $$G$$ be the non-planar graph with minimum possible number of edges. Then $$G$$ has

The maximum number of binary trees that can be formed with three unlabeled nodes is:

Consider a weighted complete graph $$G$$ on the vertex set $$\left\{ {{v_1},\,\,\,{v_2},....,\,\,\,{v_n}} \right\}$$ such that the weight of the edge $$\left( {{v_i},\,\,\,\,{v_j}} \right)$$ is $$2\left| {i - j} \right|$$. The weight of a minimum spanning tree of $$G$$ is