Let E be the external path length of a tree, that is, the sum of the path lengths to all
Chapter 6, Problem 52(choose chapter or problem)
Let E be the external path length of a tree, that is, the sum of the path lengths to all the leaves. Let I be the internal path length, that is, the sum of the path lengths to all the internal nodes. Let i be the number of internal nodes. Prove that in a binary tree where all internal nodes have two children, E = I + 2i.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer