CS 332: Algorithms

10/3/00


Click here to start


Table of Contents

CS 332: Algorithms

Review: Binary Search Trees

Review: Binary Search Trees

Review: Inorder Tree Walk

Review: BST Search

Review: BST Search (Iterative)

Review: BST Insert

Review: Sorting With BSTs

Review: Sorting With BSTs

Review: More BST Operations

Review: More BST Operations

Red-Black Trees

Red-Black Properties

Red-Black Trees

Height of Red-Black Trees

RB Trees: Proving Height Bound

RB Trees: Proving Height Bound

RB Trees: Proving Height Bound

RB Trees: Proving Height Bound

RB Trees: Worst-Case Time

Red-Black Trees: An Example

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

Red-Black Trees: The Problem With Insertion

RB Trees: Rotation

RB Trees: Rotation

Rotation Example

Rotation Example

Red-Black Trees: Insertion

PPT Slide

PPT Slide

RB Insert: Case 1

RB Insert: Case 1

RB Insert: Case 2

RB Insert: Case 3

RB Insert: Cases 4-6

Red-Black Trees: Deletion

The End

Author: David Luebke

Email: luebke@cs.virginia.edu

Home Page: http://www.cs.virginia.edu/~luebke

Download presentation source