A connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree.
A tree with ‘n’ vertices has ‘n-1’ edges
Every tree has at least two vertices of degree one.
Examples of Trees
Vertices: 4
Edge: 3
Vertices: 7
Edge: 6
Vertices: 6
Edge: 5
Vertices: 13
Edge: 12
Vertices: 13
Edge: 12
