Trees

Tree data structure is a connected acyclic graph. A graph is a tree if it is connected and the relation m=n-1 holds true, where m is number of edges and n is the number of vertices in the graph. All techniques which are useful in graphs can be leveraged in tree problems. Infact, it is usually easier to deal with trees  than graphs .