DocumentCode
2175956
Title
Biased 2-3 trees
Author
Bent, Samuel W. ; Sleator, Daniel D. ; Tarjan, Robert E.
fYear
1980
fDate
13-15 Oct. 1980
Firstpage
248
Lastpage
254
Abstract
We describe a new data structure for maintaining collections of weighted items. The access time for an item of weight w in a collection of total weight W is proportional to log(W/w) in the worst case (which is optimal in a certain sense), and several other useful operations can be made to work just, as fast. The data structure is simpler than previous proposals, but the running time must be amortized over a sequence of operations to achieve the time bounds.
Keywords
Binary search trees; Computer science; Contracts; Costs; Data structures; Dictionaries; Proposals; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1980., 21st Annual Symposium on
Conference_Location
Syracuse, NY, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1980.15
Filename
4567825
Link To Document