A TREE is defined as an undirected graph in which there exists exactly one path between any given pair of nodes. That is, a tree does not have cycles or unconnected vertices.

For example, this is a tree.

This is not a tree because it has two cycles.

Choose topics to learn more about graph and graph algorithms

Back to AlgoNet Home