Approximating Optimal Binary Decision Trees Brent Heeringa [email protected] (joint work with Micah Adler) 18 November 2005.
Rooted tree and binary tree Theorem 5.19: A full binary tree with t leaves contains i=t-1 internal vertices.
Rooted tree and binary tree