Red Black Trees

CS 5633 -- Spring 2005
ADT Dictionary / Dynamic Set

Abstract data type (ADT) Dictionary
(also called Dynamic Set):
A data structure which supports operations
Insert
Delete
Find
Using balanced binary search trees we can
implement a dictionary data structure such that
each operation takes O(log n) time.
Red-black trees
Carola Wenk
Slides courtesy of Charles Leiserson with small
changes by Carola Wenk
3/3/05
CS 5633 Analysis of Algorithms
3/3/05
Balanced search trees
3/3/05
This data structure requires an extra onebit color field in each node.
Red-black properties:
1. Every node is either red or black.
2. The root is black.
3. The leaves (NILs) are black.
4. If a node is red, then both its children are black.
5. All simple paths from any node x to a
descendant leaf have the same number of black
nodes = black-height(x).
AVL trees
2-3 trees
2-3-4 trees
B-trees
Red-black trees
Red-black trees
Balanced search tree: A search-tree data

structure for which a height of O(log n) is
guaranteed when implementing a dynamic
set of n items.
Examples:
3/3/05
Example of a red-black tree
77
77
33
NIL
18
18
NIL
10
10
88
33
h=4
22
22
11
11
NIL
NIL NIL NIL NIL
NIL
18
18
NIL
26
26
NIL
10
10
88
NIL
22
22
11
11
NIL
NIL NIL NIL NIL
26
26
NIL
NIL
1. Every node is either red or black.

3/3/05
3/3/05
77
77
33
NIL
18
18
NIL
10
10
88
33
NIL
22
22
11
11
NIL NIL NIL NIL
NIL
26
26
NIL
18
18
NIL
10
10
88
NIL
22
22
11
11
NIL NIL NIL NIL
2., 3. The root and leaves (NILs) are black.

3/3/05
NIL
26
26
NIL
NIL
4. If a node is red, then both its children are

black.
7
3/3/05
Height of a red-black tree
77 bh = 2
33
NIL
Theorem. A red-black tree with n keys has height

h 2 log(n + 1).
Proof. (The book uses induction. Read carefully.)
INTUITION:
Merge red nodes
into their black
parents.
18
18 bh = 2
NIL
bh = 1 10
10
bh = 1
88
22
22
11
11
bh = 0 NIL NIL NIL NIL
NIL
26
26
NIL
NIL
5. All simple paths from any node x to a

descendant leaf have the same number of
black nodes = black-height(x).
3/3/05
3/3/05
10

h 2 log(n + 1).
INTUITION:
Merge red nodes
into their black
parents.
3/3/05
11

h 2 log(n + 1).
INTUITION:
Merge red nodes
into their black
parents.
3/3/05
12

h 2 log(n + 1).
INTUITION:
Merge red nodes
into their black
parents.
3/3/05
13

h 2 log(n + 1).
INTUITION:
Merge red nodes
into their black
parents.
3/3/05
14
Proof (continued)

h 2 log(n + 1).
INTUITION:
Merge red nodes
h
into their black
parents.
This process produces a tree in which each node
has 2, 3, or 4 children.
The 2-3-4 tree has uniform depth h of leaves.
3/3/05
15
We have
h h/2, since
at most half
the leaves on any path
are red.
The number of leaves

in each tree is n + 1
n + 1 2h'
log(n + 1) h' h/2
h 2 log(n + 1).
3/3/05
16
Query operations
Modifying operations
The operations INSERT and DELETE cause
modifications to the red-black tree:
the operation itself,
color changes,
restructuring the links of the tree via
rotations.
Corollary. The queries SEARCH, MIN,

MAX, SUCCESSOR, and PREDECESSOR
all run in O(log n) time on a red-black
tree with n nodes.
3/3/05
17
3/3/05
Rotations
IDEA: Insert x in tree. Color x red. Only redblack property 4 might be violated. Move the
violation up the tree by recoloring until it can
be fixed with rotations and recoloring.
AA
LEFT-ROTATE(A)
AA
18
Insertion into a red-black tree
RIGHT-ROTATE(B)
BB
BB
Example:
77
33
18
18
10
10
Rotations maintain the inorder ordering of keys:

a , b , c a A b B c.
88
22
22
11
11
26
26
A rotation can be performed in O(1) time.

3/3/05
19
3/3/05
20

Example:
33
Insert x =15.
Recolor, moving the
violation up the tree.
77
Example:
33
Insert x =15.
Recolor, moving the
RIGHT-ROTATE(18).
18
18
10
10
88
22
22
11
11
26
26
15
15
3/3/05
21
3/3/05

3/3/05
18
18
15
15
10
10
88
22
22
11
11
26
26
15
15
22
Example:
77
Insert x =15.
Recolor, moving the 33
88
RIGHT-ROTATE(18).
LEFT-ROTATE(7) and recolor.
10
10
11
11
18
18
77
Example:
33
Insert x =15.
88
Recolor, moving the
RIGHT-ROTATE(18).
LEFT-ROTATE(7) and recolor.
77
22
22
26
26
23
3/3/05
10
10
18
18
11
11
15
15
22
22
26
26
24
Pseudocode
Graphical notation
RB-INSERT(T, x)
TREE-INSERT(T, x)
color[x] RED only RB property 4 can be violated
while x root[T] and color[p[x]] = RED
do if p[x] = left[p[p[x]]
then y right[p[p[x]]
y = aunt/uncle of x
if color[y] = RED
then Case 1
else if x = right[p[x]]
then Case 2 Case 2 falls into Case 3
Case 3
else then clause with left and right swapped
color[root[T]] BLACK
3/3/05
Let
All
25
Recolor
y
DD
CC
new x
CC
DD
AA
BB
AA
BB
(Or, children of
A are swapped.)
3/3/05
26
Case 2
CC
s have the same black-height.
3/3/05
Case 1
AA
denote a subtree with a black root.
Push Cs black onto

A and D, and recurse,
since Cs parent may
be red.
27
BB
LEFT-ROTATE(A)
CC
BB
AA
Transform to Case 3.
3/3/05
28
Case 3
CC
BB
Analysis
RIGHT-ROTATE(C)
y
AA
AA
Go up the tree performing Case 1, which only

recolors nodes.
If Case 2 or Case 3 occurs, perform 1 or 2
rotations, and terminate.
BB
CC
Running time: O(log n) with O(1) rotations.

RB-DELETE same asymptotic running time
and number of rotations as RB-INSERT (see
textbook).
Done! No more
violations of RB
property 4 are
possible.
3/3/05
29
3/3/05
30

Red Black Trees

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Red Black Trees

Загружено:

Авторское право:

Доступные форматы

CS 5633 -- Spring 2005

ADT Dictionary / Dynamic Set

CS 5633 Analysis of Algorithms

Balanced search trees

CS 5633 Analysis of Algorithms

Balanced search tree: A search-tree data

CS 5633 Analysis of Algorithms

CS 5633 Analysis of Algorithms

Example of a red-black tree

Example of a red-black tree

NIL NIL NIL NIL

NIL NIL NIL NIL

1. Every node is either red or black.

CS 5633 Analysis of Algorithms

CS 5633 Analysis of Algorithms

Example of a red-black tree

Example of a red-black tree

NIL NIL NIL NIL

CS 5633 Analysis of Algorithms

NIL NIL NIL NIL

2., 3. The root and leaves (NILs) are black.

4. If a node is red, then both its children are

CS 5633 Analysis of Algorithms

Example of a red-black tree

Height of a red-black tree

Theorem. A red-black tree with n keys has height

bh = 0 NIL NIL NIL NIL

5. All simple paths from any node x to a

CS 5633 Analysis of Algorithms

Height of a red-black tree

CS 5633 Analysis of Algorithms

Height of a red-black tree

Theorem. A red-black tree with n keys has height

CS 5633 Analysis of Algorithms

Theorem. A red-black tree with n keys has height

CS 5633 Analysis of Algorithms

Height of a red-black tree

Height of a red-black tree

Theorem. A red-black tree with n keys has height

CS 5633 Analysis of Algorithms

Theorem. A red-black tree with n keys has height

Height of a red-black tree

CS 5633 Analysis of Algorithms

Theorem. A red-black tree with n keys has height

CS 5633 Analysis of Algorithms

The number of leaves

CS 5633 Analysis of Algorithms

Corollary. The queries SEARCH, MIN,

CS 5633 Analysis of Algorithms

Insertion into a red-black tree

CS 5633 Analysis of Algorithms

Rotations maintain the inorder ordering of keys:

A rotation can be performed in O(1) time.

CS 5633 Analysis of Algorithms

CS 5633 Analysis of Algorithms

Insertion into a red-black tree

CS 5633 Analysis of Algorithms

Insertion into a red-black tree

Insertion into a red-black tree

CS 5633 Analysis of Algorithms

CS 5633 Analysis of Algorithms

Insertion into a red-black tree

CS 5633 Analysis of Algorithms

CS 5633 Analysis of Algorithms