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

Red–black tree

Known as: Red-black, RBT, Red black trees 
A red–black tree is a kind of self-balancing binary search tree. Each node of the binary tree has an extra bit, and that bit is often interpreted as… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents algorithms for concurrently reading and modifying a red-black tree RBTree. The algorithms allow wait-free… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
2013
2013
With the proliferation of multiprocessor computers, data structures capable of supporting several processes are a growing need… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Context. The space mission Kepler provides us with long and uninterrupted photometric time series of red giants. We are now able… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • table 1
Is this relevant?
2011
2011
I present a new implementation of balanced binary search trees, compatible with the MSets interface of the Coq Standard Library… Expand
  • figure 1
Is this relevant?
2005
2005
We show how to verify the correctness of insertion of elements into red-black trees—a form of balanced search trees—using… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
  • S. Kahrs
  • J. Funct. Program.
  • 2001
  • Corpus ID: 206292293
Chris Okasaki showed how to implement red-black trees in a functional programming language. Ralf Hinze incorporated even the… Expand
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
2001
2001
Abstract We present parallel algorithms for the following four operations on red–black trees: construction, search, insertion… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
This paper explores the structure of red-black trees by solv ing an apparently simple problem: given an ascending sequence of… Expand
  • figure 1
Is this relevant?
1997
1997
Relaxed balancing means that, in a dictionary stored as a balanced tree, the necessary rebalancing after updates may be delayed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
As we have seen, the ideal Binary Search Tree has height approximately equal to log n, where n is the number of values stored in… Expand
Is this relevant?