Posted by: atri | October 2, 2010

## Lect 14: Trees

In today’s lecture we defined trees and proved that a tree with $n$ vertices has exactly $n-1$ edges. The slides have been posted.

Next lecture, we will study the Breath First Search (BFS) algorithm. This material is from Section 3.2 in the book.