Prove by induction that the sum of the heights of all nodes in a complete binary tree/heap of height h (so having 2^h+1-1 nodes) is 2^h+1- h - 2.