Next:
Binary Search Trees
Binary Search Tree Property
Example
BST Traversals
InOrder
PreOrder
PostOrder
Analysis
Searching
Analysis
Successor(n)
Successor(n)
Successor(n)
Insertion
Examples
Delete
Delete
Delete
Pseudocode
Randomly Built BSTs
Red-Black Trees
Properties of RB Trees
Properties of RB Trees
Lemma 14.1
Properties of RB Trees
Rotations
Rotations
Rotations
Insertion
RB Trees
RB-Insert(T,x)
Case II: x's uncle is Black, x is the right child of its parent
Case III: x's uncle is Black, x is the left child of its parent
Pseudocode
Deletion
Sortof BST Delete
RB-Delete-Fixup(T,x)
Case I:
Case II:
Case III:
Case IV:
Pseudocode
Applications
Next: