Discrete Math: Trees
Problems that involve trees are a part of graph theory. Trees are
graphs that contain no circuits or cycles. Each of the problems below
involves working with graphs that are trees.
For background information elsewhere on our site, explore the
High School Discrete
Math area of the Ask Dr. Math archives. To find relevant
sites on the Web, browse and search
in our Internet Mathematics Library.
Access to these problems requires a Membership.
- Steve Maurer
Discrete Math, difficulty level 3. Given the definition of binary trees, students discover the relation between interior vertices and leaves and prove that relation.
Minimal Minnie's Cost
- Ethel Breuche, Dona Coffey
Discrete Math, difficulty level 2. Building a rail line that connects a number of different cities: a problem that involves graph theory, minimal cost spanning trees, and algorithms.
- Dona Coffey
Discrete Math, difficulty level 2. Dona is in charge of setting up a new train service to connect nine towns in a county. What's the minimum cost?