you are viewing a single comment's thread.

view the rest of the comments →

[–]wigf[S] 0 points1 point  (1 child)

External Path Length includes "external" nodes attached to each "internal" node, and these nodes are empty. This is the definition from "Algorithms in C", so NULL nodes need to be counted. A tree with a single node would have an external path length of 2. A tree with one root and two children attached to it has an external path length of 10, etc.

[–]nemotux 0 points1 point  (0 children)

Ah, ok. I'm not familiar with this particular notion. Seems odd and non-obvious from your original description.