26 views

Choose the correct alternatives (More than one may be correct).

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

1. $\leq n^{2}$ always.
2. $\geq n \log_{2} n$ always.
3. Equal to $n^{2}$ always.
4. $O(n)$ for some special trees.
asked in DS | 26 views

–1 vote
I think A) and D)