Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
2–3–4 treeAA treeAVL treeAmortized analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
GPU-acceleration of waveform relaxation methods for large differential systems
It is the purpose of this paper to provide an acceleration of waveform relaxation (WR) methods for the numerical solution of… 
2013
2013
Who Said We Need to Relax All Variables?
Despite its success in both satisficing and optimal planning, thedelete relaxation has significant pitfalls in many important… 
2013
2013
Influence of Intervarietal and Interspecific Crosses on Seed Set of Gladiolus under Mid- hill Environments of Dailekh Condition
Twelve intervarietal crosses and ten interspecific crosses of gladiolus were tested separately in RCBD, each with 4 replications… 
2012
2012
The performance model for a parallel SOR algorithm using the red-black scheme
The successive over relaxation (SOR) is a variant of the iterative Gauss-Seidel method for solving a linear system of equations… 
Highly Cited
2010
Highly Cited
2010
A SPECTROSCOPICALLY CONFIRMED X-RAY CLUSTER AT z = 1.62 WITH A POSSIBLE COMPANION IN THE SUBARU/XMM-NEWTON DEEP FIELD
We report on a confirmed galaxy cluster at z = 1.62. We discovered two concentrations of galaxies at z ∼ 1.6 in the Subaru/XMM… 
2008
2008
Reducing Splaying by Taking Advantage of Working Sets
Access requests to keys stored into a data structure often exhibit locality of reference in practice. Such a regularity can be… 
2007
2007
Exploration of lock-based software transactional memory
2002
2002
Constructing Red-Black Tree Shapes
Cormen et al. describe efficient algorithms for inserting nodes into and deleting nodes from red-black trees. If some binary… 
Review
1998
Review
1998
ALLOZYME VARIATION IN NATIVE RED DEER CERVUS ELAPHUS OF MESOLA WOOD, NORTHERN ITALY : IMPLICATIONS FOR CONSERVATION
Lorenzini R., Mattioli S. and Fico R. 1998. Allozyme variation in native red deer Cervus elaphus of Mesola Wood, northern Italy… 
1993
1993
Optimal operations on red-black trees
We show that some fundamental operations such as deletion and insertion can be performed in O(log n) time and O(1) space on red… 
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)