Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
We present practical, concurrent binary search tree (BST) algorithms that explicitly maintain logical ordering information in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
SummaryA class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper examines the relation between net buying pressure and the shape of the implied volatility function (IVF) for index and… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
This paper analyzes the statistical evidence bearing on whether transitory components account for a large fraction of the… Expand
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… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Abstract The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is… Expand
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1978
Highly Cited
1978
In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imbed… Expand
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 10
Is this relevant?
Highly Cited
1973
Highly Cited
1973
A new class of binary search trees, called trees of bounded balance, is introduced. These trees are easy to maintain in their… Expand
Is this relevant?