A tree is in undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
A common tree data structure is the:
A tree is in undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
A common tree data structure is the: