原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
when T1.bh ≤ T2.bh. f. Argue that the running time of RB-JOIN is O(lg n). 13-3 AVL trees
An AVL tree is a binary search tree that is height balanced: for each node x, the heights of the left and right subtrees of x differ by at most 1.
To implement an AVL tree, maintain an extra attribute h in each node such that x.h is the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea