← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

B 附录B 集合等离散数学基础

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.792Z

internal node. The number of children of a node x in a rooted tree T is the degree of x.6

The length of the simple path from the root r to a node x is the depth of x in T. A level of a tree consists of all nodes at the same depth. The height of a node in a tree is the number of

edges on the longest simple downward path from the node to a leaf, and the height of a tr

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea