Trees

• simple graph with

  • n nodes, all pairs connected with n-1 edges
  • only one simple path exists between any pair of nodes.
  • 1 connected components, no cycle.

• Rooted

• unrooted