原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
nto the configuration on the right. The letters α, β, and γ represent arbitrary subtrees.
A rotation operation preserves the binary-search-tree property: the keys in α precede x.key, which precedes the keys in β, which precede y.key, which precedes the keys in γ.
LEFT-ROTATE(T, x) 1 y = x.right 2 x.right = y.left // turn y’s left subtree into x’s righ
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea