原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
ts root. The following lemma shows why red-black trees make good search trees. Lemma 13.1
A red-black tree with n internal nodes has height at most 2 lg(n + 1).
Proof We start by showing that the subtree rooted at any node x contains at least 2bh(x)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea