原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
inter x traces a simple path downward looking for a NIL to replace with the input node z.
The procedure maintains the trailing pointer y as the parent of x.
After initialization, the while loop in lines 3–7 causes these two pointers to move down
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea