Question

E=i+2n proof in binary tree

Answer 1

Answer:

When n = 0 the binary tree has no internal node and 1 external node. For this tree E = I = n = 0 . Therefore, E = I + 2n . ... The internal path length of a binary tree that has n internl nodes is sum (i=1 to n) leveli where leveli is the length of the path from the root to internal node i .