Question: Suppose a binary tree has leaves ??1,??2, , ???? at depths ??1, ??2, , ????, respectively. Prove that ? 2 ????? ? 1 ?? ??=1
Suppose a binary tree has leaves ??1,??2, , ???? at depths ??1, ??2, , ????, respectively. Prove that ? 2 ????? ? 1 ?? ??=1 and determine when the equality is true.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
