Tree vs Graph
A tree is a special type of connected acyclic graph. In an undirected tree, there is exactly one simple path between every pair of vertices and n vertices have n-1 edges. A general graph may contain cycles, multiple connected components, and arbitrary relationships.
Every tree is a graph, but not every graph is a tree.
Trees are connected.
Undirected trees are acyclic.
Graphs may be directed or undirected.
Graphs may contain cycles and disconnected components.
0-2 years experience
2-5 years experience
5-8 years experience
8+ years experience