An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf.

• 一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点。