Trees

Trees

In this tutorial, We will learn about the tree in graph theory.

Tree

A graph is called a tree if

• The graph is connected i.e  there are no unreachable vertices
• There are no cycles in the graph

Example: Path graph is the simplest example of a tree

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.