CS 332: Algorithms

10/2/00


Click here to start


Table of Contents

CS 332: Algorithms

Dynamic Sets

Binary Search Trees

Binary Search Trees

Inorder Tree Walk

Inorder Tree Walk

Operations on BSTs: Search

BST Search: Example

Operations on BSTs: Search

Operations of BSTs: Insert

BST Insert: Example

BST Search/Insert: Running Time

Sorting With Binary Search Trees

Sorting With BSTs

Sorting with BSTs

Sorting with BSTs

Sorting with BSTs

More BST Operations

BST Operations: Minimum

BST Operations: Successor

BST Operations: Successor

BST Operations: Delete

BST Operations: Delete

The End

Author: David Luebke

Email: luebke@cs.virginia.edu

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

Download presentation source