Definition: When rebalancing a search tree is independent of updating the tree.
See also balanced tree, rebalance.
Note: Normally rebalancing is tightly coupled to updating: as soon as the tree is updated, rebalancing operations are applied until the given balance constraints are again fulfilled. In search trees with relaxed balance, updating and rebalancing are processes which can be controlled separately. Typically, this means that balance constraints must be relaxed such that an update can leave the tree in a well-defined state. Thus, the assumptions under which rebalancing is carried out change. This poses the problem of still carrying out the rebalancing efficiently. Kim S. Larsen's bibliographical information for
Search Trees with Relaxed Balance.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 15 July 2014.
HTML page formatted Fri Feb 23 10:06:08 2018.
Cite this as:
Kim Skak Larsen, "relaxed balance", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 15 July 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/relaxedBalance.html