A binary tree is full if all of its vertices have either zero or two children. Let
Fantastic news! We've Found the answer you've been seeking!
Question:
A binary tree is full if all of its vertices have either zero or two children. Let Bn denote the number of full binary trees with II vertices.
(a) By drawing out all full binary trees with 3. 5. or 7 vertices, determine the exact values of 83. B5, and 87. Why have we left out even numbers of vertices, like B49
(b) For general n. derive a recurrence relation for Bn.
(c) Show by induction that Bn is 20(n).
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Posted Date: