原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
mortized CPU time for any stack operation is O(1). 18-2 Joining and splitting 2-3-4 trees
The join operation takes two dynamic sets S′ and S″ and an element x such that x′.key < x.key < x″.key for any x′ ∈ S′ and x″ ∈ S″. It returns a set S = S′ ∪ {x} ∪ S″. The split operation is like an “inverse” join: given a dynamic set S and an element x ∈ S, it creates a set S′ that consists of all elements in S − {x} whose keys are less than x.key and another set S″ that consists of all elements in S − {x} whose keys are greater than x.key.
This problem investigates how to implement these operations on 2-3-4 trees (B-trees with
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea