This preview shows page 1. Sign up to view the full content.
Unformatted text preview: T (4.3, Denition 4) analogously to how it is done for full binary trees in 4.3, Denition 7, by replacing the maximum over T 1 ,T 2 in the recursive step by the maximum over all the constituent trees T 1 ,...,T n . We dene the set of leaves recursively, analogously to the preamble to 4.3, Exercise 44, to be { r } in the case that T consists only of a root r , and otherwise to be the union of the sets of leaves of the trees T 1 ,...,T n . Let n ( T ) denotes the number of nodes in T , and l ( T ) the number of leaves. Prove that n ( T ) l ( T ) h ( T ) + 1 for every rooted tree T ....
View
Full
Document
 Fall '08
 STRAIN
 Math

Click to edit the document details