Check If Given Undirected Graph is a tree | Algorithms
Objective: Given an undirected graph, Write an algorithm to determine whether its tree or not. An undirected graph is a tree if it has properties 1. There is no cycle present in the graph. 2. The graph is connected. (All the vertices in the graph are connected)