Library Home || Primary || Math Fundamentals || Pre-Algebra ||
Algebra || Geometry || Discrete Math || Trig/Calc
|Discrete Math, difficulty level 3. Given the definition of binary trees, students discover the relation between interior vertices and leaves and prove that relation.|
|Please Note: Use of the following materials requires membership. Please see the Problem of the Week membership page for more information.|
© 1994-2012 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.