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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2017
020406019632017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Phase change memory (PCM) has become a promising candidate to replace DRAM in some massive/big data applications because of its… (More)
  • table I
  • figure 3
  • figure 4
  • table II
  • figure 5
Is this relevant?
2015
2015
1 Max-Planck Institute for Informatics, Saarbrücken, Germany 66123. 2 Department of Computer Science, Saarland University, Saarbr… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
2010
2010
In this paper we propose an online shape learning algorithm based on the self-balancing binary search tree data structure for the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
I test the disposition effect, the tendency of investors to hold losing investments too long and sell winning investments too… (More)
  • figure 1
  • table I
  • figure 2
  • table II
  • table III
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • table 1
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1983
Highly Cited
1983
We use the idea of self-adjusting trees to create new, simple data structures for priority queues (which we call heaps) and… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
1978
1978
Binary search trees have received a great deal of attention in recent years. As a result of this interest, several methods have… (More)
  • figure 3
Is this relevant?