Suppose a binary tree has leaves l1, l2, ... , lM at depths d1, d2, ... , dM
Chapter 4, Problem 4.7(choose chapter or problem)
Suppose a binary tree has leaves l1, l2, ... , lM at depths d1, d2, ... , dM, respectively.Prove that Mi=1 2di 1 and determine when the equality is true.
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