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