Q3-iv

MCQMarks unknown

The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$ , where $I_{w}$ is the path length of external node $w$ ),

(A)

$\leq n^{2}$ always.

(B)

$\geq n \log_{2} n$ always.

(C)

Equal to $n^{2}$ always.

(D)

$O(n)$ for some special trees.

Loading…