PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: No information on entry rating
external path length (Definition)

Given a binary tree $ T$, construct its extended binary tree $ T'$. The external path length of $ T$ is then defined to be the sum of the lengths of the paths to each of the external nodes.

For example, let $ T$ be the following tree.

\includegraphics{tree.3}

The extended binary tree of $ T$ is

\includegraphics{tree.4}

The external path length of $ T$ (denoted $ E$) is

$\displaystyle E = 2 + 3 + 3 + 3 + 3 + 3 + 3 = 20 $

The internal path length of $ T$ is defined to be the sum of the lengths of the paths to each of the internal nodes. The internal path length of our example tree (denoted $ I$) is

$\displaystyle I = 1 + 2 + 0 + 2 + 1 + 2 = 8 $

Note that in this case $ E = I + 2n$, where $ n$ is the number of internal nodes. This happens to hold for all binary trees.




"external path length" is owned by Logan.
(view preamble | get metadata)

View style:

See Also: extended binary tree, weighted path length

Also defines:  external path length, internal path length
Log in to rate this entry.
(view current ratings)

Cross-references: number, internal nodes, tree, external nodes, paths, lengths, sum, extended binary tree, binary tree
There is 1 reference to this entry.

This is version 1 of external path length, born on 2002-03-07.
Object id is 2776, canonical name is ExternalPathLength.
Accessed 8280 times total.

Classification:
AMS MSC05C05 (Combinatorics :: Graph theory :: Trees)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)