uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
General balanced trees
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
1999 (English)In: Journal of Algorithms, Vol. 30, 1-28 p.Article in journal (Refereed) Published
Abstract [en]

We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the nodes. Thus, in the case when amortized bounds are sufficient, there is no need for sophisticated balance criteria.

The maintenance algorithms use partial rebuilding. This is important for certain applications, and has previously been used with weight-balanced trees. We show that the amortized cost incurred by general balanced trees is lower than what has been shown for weight-balanced trees.

Place, publisher, year, edition, pages
1999. Vol. 30, 1-28 p.
Keyword [en]
binary search trees, search trees, general balanced trees
URN: urn:nbn:se:uu:diva-25785OAI: oai:DiVA.org:uu-25785DiVA: diva2:53559
Available from: 2007-02-13 Created: 2007-02-13 Last updated: 2011-01-14

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Andersson, Arne
By organisation
Department of Information TechnologyComputing Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 170 hits
ReferencesLink to record
Permanent link

Direct link