原书出处
Introduction to Algorithms, Fourth Edition
13 第13章 红黑树
right child of a new root r′ with key 4 whose left child is the existing node with key 3.
Thus, you copy only part of the tree and share some of the nodes with the original tree
, as shown in Figure 13.8(b). Assume that each tree node has the attributes key, left, and
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter013.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea