The program to check if the given graph is a tree or not is discussed here.

An undirected graph is given as input,

The given graph is said to be a tree

• The graph is connected.
• When there are no cycles in the graph.

For example:

The above-given graph is not a tree because it has a cycle.

Algorithm to check if the given graph is a tree or not

• Input the graph.
• Check if the graph has any cycles in it.
• If it has a cycle, then print “The given graph is not a tree”.
• Otherwise, print”The given graph is a tree”.

Click here to learn more about FACE Prep PRO

Program to check if the given graph is a tree or not

@@coding::1@@

Recommended Programs

• Nodes at k distance from the root
• Ancestors of a given node in a binary tree
• The vertical sum of a tree
• Implement Depth First Search (DFS)
• Implement Breadth First Search (BFS)