原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
etains its right child (x in Figure 12.4(c)), and so no change to y.right needs to occur.
If y is not z’s right child (Figure 12.4(d)), then two nodes have to move.
Lines 7–9 replace y as a child of its parent by y’s right child (x in Figure 12.4(c)) and
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea