1.19

From The Algorithm Design Manual Solution Wiki
Revision as of 12:20, 1 September 2020 by Algowikiadmin (talk | contribs) (Created page with "<b>Step 1:</b> Show that the statement holds for the basis case <math>n = 1</math><br> :<math>E(n) = n - 1</math><br> :<math>E(1) = 1 - 1 = 0</math>. A tree with one node has...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Step 1: Show that the statement holds for the basis case


. A tree with one node has zero edges

Step 2: Assume that that summation is true up to n.

Step 3: Show that on the assumption that the summation is true for n, it follows that it is true for n + 1.


When adding one node to a tree one edge is added as well


QED


Back to Chapter 1.