Abstract
When search trees are made relaxed, balance constraints are weakened such that updates can be made without immediate rebalancing. This can lead to a speed-up in some circumstances. However, the weakened balance constraints also make it more challenging to prove complexity results for relaxed structures.
In our opinion, one of the simplest and most intuitive presentations of balanced search trees has been given via layered trees. We show that relaxed layered trees are among the best of the relaxed structures. More precisely, rebalancing is worst-case logarithmic and amortized constant per update, and restructuring is worst-case constant per update.
In our opinion, one of the simplest and most intuitive presentations of balanced search trees has been given via layered trees. We show that relaxed layered trees are among the best of the relaxed structures. More precisely, rebalancing is worst-case logarithmic and amortized constant per update, and restructuring is worst-case constant per update.
| Original language | English |
|---|---|
| Title of host publication | Theoretical Computer Science, 7th Italian Conference, ICTCS 2001 |
| Number of pages | 16 |
| Publication date | 2001 |
| Pages | 269-284 |
| Publication status | Published - 2001 |
| Event | Seventh Italian Conference on Theoretical Computer Science - Torino, Italy Duration: 4. Oct 2001 → 6. Oct 2001 |
Conference
| Conference | Seventh Italian Conference on Theoretical Computer Science |
|---|---|
| Country/Territory | Italy |
| City | Torino |
| Period | 04/10/2001 → 06/10/2001 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 2202 |
Fingerprint
Dive into the research topics of 'Complexity of Layered Binary Search Trees with Relaxed Balance'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver