Related articles:
B-tree
Binary tree
AVL tree
Binary search tree
Associative array
Key terms:
node
paths
delete
bh
null
sibling
struct node
red node
grandparent
source lang
parent p
same number of black nodes
binary search tree
subtree
void delete
node to its leaf nodes
given node to its leaf
all paths from any given
paths from any given node
new node n
leaf nodes contain the same
every red node are black
internal nodes
nodes contain the same number
children of every red node
both children of every red
lemma
void insert
parent node
left child of its parent
null leaf
null leaves
fill factor
tree rotation
tail recursion
colored binary tree
paths passing through
passing through n
we are deleting
will denote n
rotations occur
parent p is red
deleting a node
structurally equivalent
else delete
cluster contains
sedgewick
red black tree
deleted node
grandparent g
Search external links cited by footnotes on Wikipedia page Red-black tree:
|
|