Red-Black tree

GPTKB entity

Statements (52)
Predicate Object
gptkbp:instance_of gptkb:Google
gptkbp:has_function delete
find
insert
maximum
minimum
successor
predecessor
fix violations
rotate left
rotate right
gptkbp:has_property color properties
parent-child relationships
deletion operation
insertion operation
logarithmic height
node color
red and black nodes
search operation
balanced tree properties
binary tree structure
complexity O(log n) for operations
four properties of nodes
height balanced
red nodes cannot have red children
root is black
every path from a node to its descendant leaves has the same number of black nodes
https://www.w3.org/2000/01/rdf-schema#label Red-Black tree
gptkbp:introduced_in gptkb:1972
gptkb:Rudolf_Bayer
gptkbp:is_implemented_in various programming languages
gptkbp:is_recommended_for dynamic set operations
priority queues
associative arrays
gptkbp:is_related_to AVL tree
self-balancing trees
binary search tree
gptkbp:is_used_in gptkb:computer_science
AI algorithms
algorithms
data structures
game development
machine learning algorithms
operating systems
search engines
memory management
compiler design
graphics rendering
database indexing
network routing algorithms
gptkbp:bfsParent gptkb:Adelson-Velsky
gptkbp:bfsLayer 5