FAQ

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

Topic mentions per year

Topic mentions per year

1985-2017
010203019852017

Related topics

Related topics

29 relations
2–3–4 treeAA treeAVL treeAmortized analysis
(More)

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Red–black tree
Computer science
Real-time computing
Functional programming
Tree (data structure)
B-tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Relativistic red-black trees
Operating system performance and scalability on sharedmemory many-core systems depends critically on efficient access to shared… (More)
Is this relevant?
2013
2013
Code specialization for red-black tree management algorithms
A lot of work is spent on low-level optimization for regular computations; from instruction scheduling and cache-aware design to… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2013
2013
Concurrent Wait-Free Red Black Trees
We present a new wait-free algorithm for concurrently accessing a red-black tree in an asynchronous shared memory system that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Lock-Free Red-Black Trees Using CAS
The negative side-effects of using lock-based synchronization mechanisms are well known and include unexpected scheduling… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 8
  • figure 9
Is this relevant?
2008
2008
Left-leaning Red-Black Trees
The red-black tree model for implementing balanced search trees, introduced by Guibas and Sedgewick thirty years ago, is now… (More)
Is this relevant?
2005
2005
Verifying Red-Black Trees?
We show how to verify the correctness of insertion of elements into red-black trees—a form of balanced search trees—using… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Parallel algorithms for red-black trees
We present parallel algorithms for the following four operations on red–black trees: construction, search, insertion, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Red-black trees with types
Chris Okasaki showed how to implement red-black trees in a functional programming language. Ralf Hinze incorporated even the… (More)
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
1999
1999
Constructing Red-Black Trees
This paper explores the structure of red-black trees by solving an apparently simple problem: given an ascending sequence of… (More)
  • figure 1
Is this relevant?
1997
1997
Relaxed Balanced Red-Black Trees
Relaxed balancing means that, in a dictionary stored as a balanced tree, the necessary rebalancing after updates may be delayed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?