Question on Binary tree

  1. The internal path length of a full binary tree is the sum, taken over all internal nodes of the tree, of the depth of each node. Likewise, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Consider a full binary tree with n internal nodes, internal path length i, and external path length e. Prove that e=i+2n
     
  2. jcsd
  3. Ask yourself what does it mean for the tree to be "full". How many leaves does it have?

    Probably this should not be in the number theory forum.
     
Know someone interested in this topic? Share this thead via email, Google+, Twitter, or Facebook

Have something to add?