Topic 10 Trees Tree Definitions Tree Definitions Tree

  • Slides: 85
Download presentation
Topic 10 Trees

Topic 10 Trees

Tree Definitions

Tree Definitions

Tree Definitions

Tree Definitions

Tree Definitions

Tree Definitions

Binary Search Tree

Binary Search Tree

Traversal • Operations tree

Traversal • Operations tree

Announcements • Participation 4 is up • Homework 3 grading • Homework 4 grading

Announcements • Participation 4 is up • Homework 3 grading • Homework 4 grading

Search

Search

Insertion

Insertion

Deletion • Need – Min/max – Successor/predecessor

Deletion • Need – Min/max – Successor/predecessor

Pseudocode

Pseudocode

Pseudocode

Pseudocode

AVL

AVL

Height of AVL Tree

Height of AVL Tree

Proof

Proof

Insertion

Insertion

Example

Example

Single Right

Single Right

Left-Right

Left-Right

Four cases

Four cases

Deletions

Deletions

Example

Example

Announcements • Test in 2 weeks • Participation due tomorrow – Clarification

Announcements • Test in 2 weeks • Participation due tomorrow – Clarification

Splay Trees

Splay Trees

Amortized Running Time • Runtime:

Amortized Running Time • Runtime:

Basic Operations

Basic Operations

When to Splay

When to Splay

Zig

Zig

Zig-Zag

Zig-Zag

Zig-zig

Zig-zig

Example

Example

Deletion

Deletion

Optimal BST

Optimal BST

Notation

Notation

Example

Example

Example

Example

More Notation • (i, j) • (j+1, j)

More Notation • (i, j) • (j+1, j)

Observations

Observations

Observations

Observations

Announcements • Participation due • Clarifications on previous topics today – Splay tree deletion

Announcements • Participation due • Clarifications on previous topics today – Splay tree deletion – Universal Hashing

Guaranteeing O(n) time

Guaranteeing O(n) time

Birthday Paradox

Birthday Paradox

Universal Hashing (clarification)

Universal Hashing (clarification)

Computing the Optimal BST • How to compute cost? • Subtree at different depths

Computing the Optimal BST • How to compute cost? • Subtree at different depths

w(i, j)

w(i, j)

AST

AST

AST

AST

Example • Sequences/Probabilities

Example • Sequences/Probabilities

Leaves

Leaves

The Big Idea

The Big Idea

Subtrees with one key

Subtrees with one key

Subtrees with 2 keys

Subtrees with 2 keys

Solution

Solution

2 -3 Trees • A search tree • Properties

2 -3 Trees • A search tree • Properties

Insertion

Insertion

Deletion • Remove • Borrow • Coalesce

Deletion • Remove • Borrow • Coalesce

Remove

Remove

Borrow

Borrow

Coalesce

Coalesce

Generalizing/Example

Generalizing/Example

Tournament Trees Winner trees Loser Trees Winner TreesTournament Trees Winner trees Loser Trees Winner Trees
Tournament Trees Winner trees Loser Trees Winner TreesTournament Trees Winner trees Loser Trees Winner Trees
Selection Trees Winner trees Loser Trees Winner TreesSelection Trees Winner trees Loser Trees Winner Trees
Trees trees binary trees traversals of trees templateTrees trees binary trees traversals of trees template
Tournament Trees Winner trees Loser Trees Winner TreeTournament Trees Winner trees Loser Trees Winner Tree
Trees Binary Trees Extended Binary Trees Tree ATrees Binary Trees Extended Binary Trees Tree A
CMSC 202 Trees Tree Definitions 1 A treeCMSC 202 Trees Tree Definitions 1 A tree
CMSC 202 Trees Tree Definitions 1 A treeCMSC 202 Trees Tree Definitions 1 A tree
Trees Introduction Applications Tree types Binary tree TreeTrees Introduction Applications Tree types Binary tree Tree
Trees Family Tree Tree Definition A tree isTrees Family Tree Tree Definition A tree is
Tree 1 Tree Definitions 2 Binary Tree TraversalsTree 1 Tree Definitions 2 Binary Tree Traversals
Tree 1 Tree Definitions 2 Binary Tree TraversalsTree 1 Tree Definitions 2 Binary Tree Traversals
Chapter 7 Trees Trees w Trees are importantChapter 7 Trees Trees w Trees are important
Trees and More Trees 1 Trees and MoreTrees and More Trees 1 Trees and More
Trees Rooted Trees Spanning trees and Shortest PathsTrees Rooted Trees Spanning trees and Shortest Paths
Trees Chapter 11 Trees Overview Trees are aTrees Chapter 11 Trees Overview Trees are a
Binary Trees and Binary Search Trees Binary TreesBinary Trees and Binary Search Trees Binary Trees
TREES INTO CARTONS CARTONS INTO TREES TREES INTOTREES INTO CARTONS CARTONS INTO TREES TREES INTO
TREES INTO CARTONS CARTONS INTO TREES TREES INTOTREES INTO CARTONS CARTONS INTO TREES TREES INTO
GENERAL TREES BINARY TREES 1 TREES Previous dataGENERAL TREES BINARY TREES 1 TREES Previous data
Trees Binary Trees and Binary Search Trees 2Trees Binary Trees and Binary Search Trees 2
CS 3424 AVL Trees RedBlack Trees Trees AsCS 3424 AVL Trees RedBlack Trees Trees As
AVL Trees AA Trees Balancing Binary Search TreesAVL Trees AA Trees Balancing Binary Search Trees
Trees and Binary Search Trees Using binary treesTrees and Binary Search Trees Using binary trees