CSE 326: Data Structures Lecture #7 Branching Out

1/28/00


Click here to start


Table of Contents

CSE 326: Data Structures Lecture #7 Branching Out

Today’s Outline

HW #2

Problem #3

Problem #8: How is a Queue like a Stack like a Priority Queue?

Tree Calculations

Tree Calculations Example

Binary Trees

Representation

What We Can Do So Far

Dictionary ADT

Search ADT

A Modest Few Uses

Desiderata

Naïve Implementations

Binary Search Tree Dictionary Data Structure

Example and Counter-Example

In Order Listing

Finding a Node

Iterative Find

Insert

Digression: Value vs. Reference Parameters

BuildTree for BSTs

Analysis of BuildTree

Bonus: FindMin/FindMax

To Do

Coming Up

 Author: Steve Wolfman

Email: owner-cse326@cs.washington.edu

Home Page: http://www.cs.washington.edu/326/

Download presentation source