red black trees
DESCRIPTION
TRANSCRIPT
![Page 1: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/1.jpg)
1
Red-Black Trees
by Thomas A. Anastasio
![Page 2: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/2.jpg)
2
A Red-Black Tree with NULLs shown
Black-Height of the tree = 4
![Page 3: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/3.jpg)
3
Red-Black Trees
• Definition: A red-black tree is a binary search tree where:– Every node is either red or black.
– Each NULL pointer is considered to be a black node
– If a node is red, then both of its children are black.
– Every path from a node to a leaf contains the same number of black nodes.
• Definition: The black-height of a node, n, in a red-black tree is the number of black nodes on any path to a leaf, not counting n.
![Page 4: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/4.jpg)
4
A valid Red-Black Tree
Black-Height = 2
![Page 5: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/5.jpg)
5
![Page 6: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/6.jpg)
6
![Page 7: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/7.jpg)
7
Theorem 1 – Any red-black tree with root x, has at least n = 2bh(x) – 1 internal nodes, where bh(x) is the black height of node x.
Proof: by induction on height of x.
![Page 8: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/8.jpg)
8
Theorem 2 – In a red-black tree, at least half the nodes on any path from the root to a leaf must be black.
Proof – If there is a red node on the path, there must be a corresponding black node.
![Page 9: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/9.jpg)
9
Theorem 3 – In a red-black tree, no path from any node, N, to a leaf is more than twice as long as any other path from N to any other leaf.
Proof: By definition, every path from a node to any leaf contains the same number of black nodes. By Theorem 2, a least ½ the nodes on any such path are black. Therefore, there can no more than twice as many nodes on any path from N to a leaf as on any other path. Therefore the length of every path is no more than twice as long as any other path
![Page 10: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/10.jpg)
10
Theorem 4 –A red-black tree with n internal nodes has height h <= 2 lg(n + 1).
Proof: Let h be the height of the red-black tree with root x. By Theorem 2,
bh(x) >= h/2From Theorem 1, n >= 2bh(x) - 1Therefore n >= 2 h/2 – 1
n + 1 >= 2h/2
lg(n + 1) >= h/22lg(n + 1) >= h
![Page 11: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/11.jpg)
11
Bottom –Up Insertion
• Insert node as usual in BST• Color the Node RED• What Red-Black property may be violated?
– Every node is Red or Black– Leaf nodes are Black NULLS– If node is Red, both children must be Black– Every path from node to descendant leaf must
contain the same number of Blacks
![Page 12: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/12.jpg)
12
Bottom Up Insertion• Insert node; Color it RED; X is pointer to it• Cases
0: X is the root -- color it black1: Both parent and uncle are red -- color parent and uncle black,
color grandparent red, point X to grandparent, check new situation
2 (zig-zag): Parent is red, but uncle is black. X and its parent are opposite type children -- color grandparent red, color X black, rotate left on parent, rotate right on grandparent
3 (zig-zig): Parent is red, but uncle is black. X and its parent are both left or both right children -- color parent black, color grandparent red, rotate right on grandparent
![Page 13: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/13.jpg)
13
X
P
G
U
P
G
U
Case 1 – U is Red
Just Recolor and move up
X
![Page 14: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/14.jpg)
14
X
P
G
U
S X
P G
SU
Case 2 – Zig-Zag
Double Rotate X around P; X around G
Recolor G and X
![Page 15: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/15.jpg)
15
X
P
G
U
S P
X G
S U
Case 3 – Zig-Zig
Single Rotate P around G
Recolor P and G
![Page 16: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/16.jpg)
16
11
14
15
2
1 7
5 8
Black node Red node
Insert 4 into this R-B Tree
![Page 17: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/17.jpg)
17
Insertion Practice
Insert the values 2, 1, 4, 5, 9, 3, 6, 7 into an initially empty Red-Black Tree
![Page 18: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/18.jpg)
18
Asymptotic Cost of Insertion
• O(lg n) to descend to insertion point
• O(1) to do insertion
• O(lg n) to ascend and readjust == worst case only for case 1
• Total: O(log n)
![Page 19: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/19.jpg)
Red-Black Trees
Bottom-Up Deletion
![Page 20: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/20.jpg)
Recall “ordinary” BST Delete
1. If vertex to be deleted is a leaf, just delete it.
2. If vertex to be deleted has just one child, replace it with that child
3. If vertex to be deleted has two children, replace the value of by it’s in-order predecessor’s value then delete the in-order predecessor (a recursive step)
![Page 21: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/21.jpg)
Bottom-Up Deletion
1. Do ordinary BST deletion. Eventually a “case 1” or “case 2“ will be done (leaf or just one child). If deleted node, U, is a leaf, think of deletion as replacing with the NULL pointer, V. If U had one child, V, think of deletion as replacing U with V.
2. What can go wrong??
![Page 22: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/22.jpg)
Which RB Property may be violated after deletion?
1. If U is red?
Not a problem – no RB properties violated
2. If U is black?
If U is not the root, deleting it will change the black-height along some path
![Page 23: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/23.jpg)
Fixing the problem
• Think of V as having an “extra” unit of blackness. This extra blackness must be absorbed into the tree (by a red node), or propagated up to the root and out of the tree.
• There are four cases – our examples and “rules” assume that V is a left child. There are symmetric cases for V as a right child
![Page 24: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/24.jpg)
Terminology• The node just deleted was U
• The node that replaces it is V, which has an extra unit of blackness
• The parent of V is P
• The sibling of V is S
Black Node
Red Node
Red or Black and don’t care
![Page 25: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/25.jpg)
Bottom-Up DeletionCase 1
• V’s sibling, S, is Red– Rotate S around P and recolor S & P
• NOT a terminal case – One of the other cases will now apply
• All other cases apply when S is Black
![Page 26: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/26.jpg)
Case 1 DiagramP
SV+P
S
V+
Rotate
P
V+
SRecolor
![Page 27: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/27.jpg)
Bottom-Up DeletionCase 2
• V’s sibling, S, is black and has two black children.– Recolor S to be Red– P absorbs V’s extra blackness
• If P is Red, we’re done
• If P is Black, it now has extra blackness and problem has been propagated up the tree
![Page 28: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/28.jpg)
Case 2 diagram
P
SV+
P+
SV
Recolor and absorb
Either extra black absorbed by P or
P now has extra blackness
![Page 29: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/29.jpg)
Bottom-Up DeletionCase 3
• S is black
• S’s RIGHT child is RED (Left child either color)– Rotate S around P– Swap colors of S and P, and color S’s Right
child Black
• This is the terminal case – we’re done
![Page 30: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/30.jpg)
Case 3 diagramsP
SV+P
S
V
Rotate
P
S
V
Recolor
![Page 31: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/31.jpg)
Bottom-Up DeletionCase 4
• S is Black, S’s right child is Black and S’s left child is Red– Rotate S’s left child around S– Swap color of S and S’s left child– Now in case 3
![Page 32: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/32.jpg)
Case 4 DiagramsP
SV+
P
S
V+Rotate
P
SV+
Recolor
![Page 33: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/33.jpg)
65
50 80
10 60 70 90
62
Perform the following deletions, in the order specifiedDelete 90, Delete 80, Delete 70
![Page 34: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/34.jpg)
Red Black Trees
Top-Down Insertion
![Page 35: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/35.jpg)
Review of Bottom-Up Insertion
• In B-Up insertion, “ordinary” BST insertion was used, followed by correction of the tree on the way back up to the root
• This is most easily done recursively– Insert winds up the recursion on the way down
the tree to the insertion point– Fixing the tree occurs as the recursion unwinds
![Page 36: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/36.jpg)
Top-Down Insertion Strategy
• In T-Down insertion, the corrections are done while traversing down the tree to the insertion point.
• When the actual insertion is done, no further corrections are needed, so no need to traverse back up the tree.
• So, T-Down insertion can be done iteratively which is generally faster
![Page 37: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/37.jpg)
Goal of T-D Insertion
• Insertion is always done as a leaf (as in ordinary BST insertion)
• Recall from the B-Up flow chart that if the uncle of a newly inserted node is black, we restore the RB tree properties by one or two local rotations and recoloring – we do not need to make changes further up the tree
![Page 38: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/38.jpg)
Goal (2)
• Therefore, the goal of T-D insertion is to traverse from the root to the insertion point in such a way that RB properties are maintained, and at the insertion point, the uncle is Black.
• That way we may have to rotate and recolor, but not propagate back up the tree
![Page 39: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/39.jpg)
Possible insertion configurations
X (Red or Black)
Y Z
If a new node is inserted as a child of Y or Z, there is no problem since the new node’s parent is black
![Page 40: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/40.jpg)
Possible insertion configurations
X
Y Z
If new node is child of Z, no problem since Z is black.
If new node is child of Y, no problem since the new node’s uncle (Z) is black – do a few rotations and recolor…. done
![Page 41: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/41.jpg)
Possible insertion configurations
X
Y Z
If new node is inserted as child of Y or Z, it’s uncle will be red and we will have to go back up the tree. This is the only case we need to avoid.
![Page 42: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/42.jpg)
Top-Down Traversal
X
Y Z
As we traverse down the tree and encounter this case, we recolor and possible do some rotations.
There are 3 cases.
Remember the goal – to create an insertion point at which the parent of the new node is Black, or the uncle of the new node is black.
![Page 43: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/43.jpg)
Case 1 – X’s Parent is Black
X
ZY
P
X
Z
P
Just recolor and continue down the tree
Y
![Page 44: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/44.jpg)
Case 2
• X’s Parent is Red (so Grandparent is Black) and X and P are both left/right children– Rotate P around G– Color P black– Color G red
• Note that X’s uncle, U, must be black because it (a) was initially black, or (b) would have been made black when we encountered G (which would have had two red children -- X’s Parent and X’s uncle)
![Page 45: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/45.jpg)
Case 2 diagrams
X
ZY
P
G
U
SX
Z
Y
P
G
US
Rotate P around G. Recolor X, Y, Z, P and G
![Page 46: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/46.jpg)
Case 3
• X’s Parent is Red (so Grandparent is Black) and X and P are opposite children– Rotate P around G– Color P black– Color G red
• Again note that X’s uncle, U, must be black because it (a) was initially black, or (b) would have been made black when we encountered G (which would have had two red children -- X’s Parent and X’s uncle)
![Page 47: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/47.jpg)
Case 3 Diagrams (1 of 2)
X
ZY
P
G
U
S
X
YS
P
G
U
Z
Step 1 – recolor X, Y and Z. Rotate X around P.
![Page 48: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/48.jpg)
Case 3 Diagrams (2 of 2)
X
YS
P
G
U
Z
P
YS
X
G
UZ
Step 2 – Rotate X around G. Recolor X and G
![Page 49: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/49.jpg)
An exercise – insert F
D
T
W
ZV
L
J P
E K
![Page 50: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/50.jpg)
Top-Down Insert Summary
P
X
Y Z
Case 1
P is Black
Just Recolor
P
X
Y Z
Case 2P is RedX & P both left/right
P
X
Y Z
G
P
X
Y Z
GRecolorX,Y,Z
P
X
Y Z
GRotate P around GRecolor P,G
Case 3P is RedX and P are opposite children
P
X
Y Z
GRecolor X,Y,Z Rotate X around P
X
P
Y Z
G
Rotate X around GRecolor X, G
Recolor X,Y,Z
X
P
Y Z
G
![Page 51: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/51.jpg)
Red Black Trees
Top-Down Deletion
![Page 52: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/52.jpg)
Recall the rules for BST deletion
1. If vertex to be deleted is a leaf, just delete it.
2. If vertex to be deleted has just one child, replace it with that child
3. If vertex to be deleted has two children, replace the value of by it’s in-order predecessor’s value then delete the in-order predecessor (a recursive step)
![Page 53: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/53.jpg)
What can go wrong?
1. If the delete node is red?
Not a problem – no RB properties violated
2. If the deleted node is black?
If the node is not the root, deleting it will change the black-height along some path
![Page 54: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/54.jpg)
The goal of T-D Deletion
• To delete a red leaf
• How do we ensure that’s what happens?– As we traverse the tree looking for the leaf to
delete, we change every node we encounter to red.
– If this causes a violation of the RB properties, we fix it
![Page 55: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/55.jpg)
Bottom-Up vs. Top-Down
• Bottom-Up is recursive– BST deletion going down the tree (winding up
the recursion)– Fixing the RB properties coming back up the
tree (unwinding the recursion)
• Top-Down is iterative– Restructure the tree on the way down so we
don’t have to go back up
![Page 56: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/56.jpg)
Terminology
• Matching Weiss text section 12.2– X is the node being examined
– T is X’s sibling
– P is X’s (and T’s) parent
– R is T’s right child
– L is T’s left child
• This discussion assumes X is the left child of P. As usual, there are left-right symmetric cases.
![Page 57: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/57.jpg)
Basic Strategy
• As we traverse the tree, we change every node we visit, X, to Red.
• When we change X to Red, we know– P is also Red (we just came from there)– T is black (since P is Red, it’s children are
Black)
![Page 58: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/58.jpg)
Step 1 – Examine the root
1. If both of the root’s children are Blacka. Make the root Red
b. Move X to the appropriate child of the root
c. Proceed to step 2
2. Otherwise designate the root as X and proceed to step 2B.
![Page 59: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/59.jpg)
Step 2 – the main caseAs we traverse down the tree, we continually
encounter this situation until we reach the node to be deleted
X is Black, P is Red, T is Black
We are going to color X Red, then recolor other nodes and possibly do rotation(s) based on the color of X’s and T’s children
2A. X has 2 Black children2B. X has at least one Red child
![Page 60: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/60.jpg)
P
TX
Case 2AX has two Black Children
2A1. T has 2 Black Children
2A2. T’s left child is Red
2A3. T’s right child is Red
** if both of T’s children are Red, we can do either 2A2 or 2A3
![Page 61: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/61.jpg)
Case 2A1X and T have 2 Black Children
P
TX
P
TX
Just recolor X, P and T and move down the tree
![Page 62: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/62.jpg)
Case 2A2
P
TX
L
X has 2 Black Children and T’s Left Child is Red
Rotate L around T, then L around PRecolor X and P then continue down the tree
L1 L2
P T
X
L
L1 L2
![Page 63: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/63.jpg)
Case 2A3
P
TX
X has 2 Black Children and T’s Right Child is Red
Rotate T around PRecolor X, P, T and R then continue down the tree
R1 R2
P R
X
T
R2R1R
L L
![Page 64: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/64.jpg)
Case 2BX has at least one Red child
Continue down the tree to the next level
If the new X is Red, continue down again
If the new X is Black (T is Red, P is Black)
Rotate T around P
Recolor P and T
Back to main case – step 2
![Page 65: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/65.jpg)
Case 2B Diagram
P
X T
Move down the tree.
P
X T
P
T X
If move to Black child (2B2)Rotate T around P; Recolor P and TBack to step 2, the main case
If move to the Red child (2B1) Move down again
![Page 66: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/66.jpg)
Step 3
Eventually, find the node to be deleted – a leaf or a node with one non-null child that is a leaf.
Delete the appropriate node as a Red leaf
Step 4Color the Root Black
![Page 67: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/67.jpg)
Example 1Delete 10 from this RB Tree
15
17
1620
23181310
7
12
6
3
Step 1 – Root has 2 Black children. Color Root Red
Descend the tree, moving X to 6
![Page 68: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/68.jpg)
Example 1 (cont’d)
15
17
1620
23181310
7
12
6
3
One of X’s children is Red (case 2B). Descend down the tree, arriving at 12. Since the new X (12) is also Red (2B1), continue down the tree, arriving at 10.
X
![Page 69: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/69.jpg)
Example 1 (cont’d)
15
17
1620
23181310
7
12
6
3
Step 3 -Since 10 is the node to be deleted, replace it’s value with the value of it’s only child (7) and delete 7’s red node
X
![Page 70: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/70.jpg)
Example 1 (cont’d)
15
17
1620
2318137
12
6
3
The final tree after 7 has replaced 10 and 7’s red node deleted and (step 4) the root has been colored Black.
![Page 71: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/71.jpg)
Example 2Delete 10 from this RB Tree
15
17
1620
1310
12
6
3
42
Step 1 – the root does not have 2 Black children.
Color the root red, Set X = root and proceed to step 2
![Page 72: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/72.jpg)
Example 2 (cont’d)
15
17
1620
1310
12
6
3
42
X
X has at least one Red child (case 2B). Proceed down the tree, arriving at 6. Since 6 is also Red (case 2B1), continue down the tree, arriving at 12.
![Page 73: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/73.jpg)
Example 2 (cont’d)
15
17
1620
1310
12
6
3
42
X
X has 2 Black children. X’s sibling (3) also has 2 black children.Case 2A1– recolor X, P, and T and continue down the tree, arriving at 10.
P
T
![Page 74: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/74.jpg)
Example 2 (cont’d)
15
17
1620
1310
12
6
3
42
P
X T
X is now the leaf to be deleted, but it’s Black, so back to step 2.X has 2 Black children and T has 2 Black children – case 2A1
Recolor X, P and T. Step 3 -- Now delete 10 as a red leaf.Step 4 -- Recolor the root black
![Page 75: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/75.jpg)
Example 2 Solution
15
17
1620
13
12
6
3
42
![Page 76: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/76.jpg)
Example 3Delete 11 from this RB Tree
15
1311
12
10
5
73
6 9 2 4
Valid and unaffected Right subtree
Step 1 – root has 2 Black children. Color Root red.
Set X to appropriate child of root (10)
![Page 77: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/77.jpg)
Example 3 (cont’d)
15
1311
12
10
5
73
6 9 2 4
X
X has one Red child (case 2B)
Traverse down the tree, arriving at 12.
![Page 78: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/78.jpg)
Example 3 (cont’d)
15
1311
12
10
5
73
6 9 4
X
Since we arrived at a black node (case 2B2) assuring T is red and P is black), rotate T around P, recolor T and P
Back to step 2
P
T
2
![Page 79: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/79.jpg)
Example 3 (cont’d)
15
1311
12
10
5
73
6 9 4
XP
T
2
Now X is Black with Red parent and Black sibling.X and T both have 2 Black children (case 2A1)Just recolor X, P and T and continue traversal
![Page 80: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/80.jpg)
Example 3 (cont’d)15
1311
12
10
5
73
6 9 4X
P
T 2
Having traversed down the tree, we arrive at 11, the leaf to be deleted, but it’s Black, so back to step 2.X and T both have two Black children. Recolor X, P and T.Step 3 -- delete 11 as a red leaf. Step 4 -- Recolor the root black
![Page 81: Red Black Trees](https://reader033.vdocuments.net/reader033/viewer/2022061207/54844df6b4af9f5b078b45cf/html5/thumbnails/81.jpg)
Example 3 Solution
13
12
10
5
73
6 9 4 2
15