The total external path length, \(\text{EPL},\) of a full binary tree with…

PYQ GATE 1990Modified — slightly modified from the official paper; see the solution

The total external path length, EPL,\text{EPL}, of a full binary tree with nn external nodes is, EPL=∑wIw\text{EPL}= \displaystyle \sum_{w} I_w, where IwI_{w} is the path length of external node ww),

  1. A.

    ≤nlog⁡2n\leq n \log_{2} n always.

  2. B.

    ≥nlog⁡2n\geq n \log_{2} n always.

  3. C.

    Equal to n2n^{2} always.

  4. D.

    O(n)O(n) for some special trees.

Attempted by 26 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…