Unformatted text preview: Induction Hypothesis : Assume that the theorem is correct for any full K-ary tree containing n internal nodes. Induction Step : Add K children to an arbitrary leaf node of the tree with n internal nodes. This new tree now has 1 more internal node, and K − 1 more leaf nodes, so theorem still holds. Thus, the theorem is correct, by the principle of Mathematical Induction. 6.14 (a) CA/BG///FEDD///H/I// (b) C A /B G/F E D/H /I 6.15 X | P-----| | | C Q R---| | V M...
View Full Document
- Fall '08
- Mathematical Induction, Natural number, Mathematical logic, Plant morphology, Mathematical proof