TOPICS
Search

Internal Path Length

ExtendedBinaryTree

The internal path length of an extended binary tree is a sum I over all internal (circular) nodes of the paths from the root to each node. For example, in the tree above, the internal path length is 11 (Knuth 1997, pp. 399-400). The internal and external path lengths are related by

E=I+2n,

where n is the number of internal nodes.

See also

Extended Binary Tree, External Path Length

Explore with Wolfram|Alpha

References

Knuth, D. E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd ed. Reading, MA: Addison-Wesley, 1997.

Referenced on Wolfram|Alpha

Internal Path Length

Cite this as:

Weisstein, Eric W. "Internal Path Length." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/InternalPathLength.html

Subject classifications