The existence and construction of non-extreme (a,b)-trees
In amortized analysis of data structures, it is standard to assume that initially the structure is empty. Usually, results cannot be established otherwise. In this paper, we investigate the possibilities of establishing such results for initially non-empty multi-way trees. (C) 2002 Elsevier Science B.V. All rights reserved.
amortized analysis data structures analysis of algorithms search trees