Advertisement

Acta Informatica

, Volume 38, Issue 8, pp 565–586 | Cite as

Relaxed red-black trees with group updates

  • Kim S. Larsen
Original article

Abstract.

In search trees with relaxed balance, updating and rebalancing have been uncoupled such that rebalancing can be controlled separately. Recently, it has been shown how an advanced update such as an insertion of an entire tree into a relaxed multi-way structure can be implemented efficiently. This indicates a similar result for binary trees by a naive interpretation of small multi-way tree nodes as binary configurations. However, this would imply that nodes must be connected by level links, which significantly deviates from the usual structural implementations of binary trees. In this paper, we show that it is possible to define binary schemes which are both natural and efficient.

Keywords

Binary Tree Search Tree Tree Node Entire Tree Level Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Kim S. Larsen
    • 1
  1. 1.Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Campusvej 55, 5230 Odense M, Denmark (e-mail: kslarsen@imada.sdu.dk) DK

Personalised recommendations