Skip to search formSkip to main contentSkip to account menu

Self-balancing binary search tree

Known as: Balanced binary tree, Height-balanced binary search tree, Rebalance 
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AA treeAVL treeAmortized analysisArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Rethinking self-balancing binary search tree over phase change memory with write asymmetry
Phase change memory (PCM) has become a promising candidate to replace DRAM in some massive/big data applications because of its… 
2016
2016
Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii List of Abbreviations and Symbols Used… 
2010
2010
Regional Trade Policy Cooperation and Architecture in East Asia
The global financial and economic crisis has affected East Asia mainly through the trade channel. The region remains heavily… 
2009
2009
Dynamic Hedging Under Jump Diffusion with Transaction Costs
If the price of an asset follows a jump diffusion process, the market is in general incomplete. In this case, hedging a… 
2008
2008
An Online Self-Balancing Binary Search Tree for Hierarchical Shape Matching
In this paper we propose a self-balanced binary search tree data structure for shape matching. This was originally developed as a… 
Review
2008
Review
2008
Use of supportive context by younger and older adult listeners: Balancing bottom-up and top-down information processing
Older adults often have more difficulty listening in challenging environments than their younger adult counterparts. On the one… 
Highly Cited
2003
Highly Cited
2003
Asset Allocation and the Liquidity Premium for Illiquid Annuities
Academics and practitioners alike have developed numerous techniques for benchmarking investment returns to properly adjust… 
1995
1995
An empirical assessment of priority queues in event-driven molecular dynamics simulation
Highly Cited
1985
Highly Cited
1985
An Optimal Admissible Tree Search
!The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known… 
1984
1984
Multidimensional Height-Balanced Trees
A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)