【离散数学】 SEU - 23 - 2021/05/26 - Trees

最新推荐文章于 2022-05-11 15:22:08 发布

Teddy van Jerry

最新推荐文章于 2022-05-11 15:22:08 发布

阅读量952

点赞数

分类专栏：【离散数学】文章标签：离散数学 Mathematics 数学

本文链接：https://blog.csdn.net/weixin_50012998/article/details/117353097

版权

43 篇文章 6 订阅

订阅专栏

Discrete Mathematics and its Applications (8th Edition)
2021/05/26 - Trees

11 Trees

If $v$ is a vertex other than the root, the parent of $v$ is the unique vertex $u$ such that there is a directed edge from $u$ to $v$ . $v$ is called a child of $u$ .
Vertices with the same parent are called siblings.
The ancestors of a vertex are the vertices in the path from the root to this vertex, excluding the vertex itself and including the root.
The descendants of a vertex v are those vertices that have v as an ancestor.
A vertex of a rooted tree with no children is called a leaf. Vertices that have children are called internal vertices.
If $a$ is $a$ vertex in a tree, the subtree with $a$ as its root is the subgraph of the tree consisting of $a$ and its descendants and all edges incident to these descendants.