Study Guide 
Tucker: Applied Combinatorics 
§3.2 Search Trees & Spanning Trees
Dr. Lee Eimers
Revised 11-06-07

Introduction:  In this brief section, we are introduced to a systematic method for finding solutions to problems using trees.

Concepts and Vocabulary:
The following boldfaced (or italic) terms and phrases introduced in this section.
Backtracking 
Breadth-first search 

Depth-first search 
Inorder traversal 
Postorder traversal		 Preorder traversal 
Pruning
Points of Interest:

1.  Know when it is appropriate to choose breadth-first and when depth-first searches.  Be able to explain why we would not want to use just one type all the time.

2.  Study the examples carefully to get an idea of the variety of problems that this method applies to.

Homework Assignment:
Do to hand in: #1, 6, 9, 11, 18, 20, 25, 30
Enrichment problems: #21 thru 32.  >
Thought for the Day
Ignorance doesn't kill you,
but it makes you sweat a lot.
-- Haitian Proverb --

If you had your life to live over again
--you'd need more money.
--Construction Digest--