原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
t if u is a right child. Because v may be NIL, lines 6–7 update v.p only if v is non-NIL.
The procedure TRANSPLANT does not attempt to update v.left and v.right.
Doing so, or not doing so, is the responsibility of TRANSPLANT’s caller. The procedure TR
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea