CSE 326: Data Structures Lecture #18 Fistful of Data Structures
Today’s Outline
Thinking about DecreaseKey in Leftist Heaps
DecreaseKey in Leftist Heaps
Fixing DecreaseKey in Leftist Heaps
DecreaseKey runtime
Delete in Leftist Heaps
Binomial Trees
First Five Binomial Trees
Binomial Queue Heap Data Structure
Insertion in Binomial Queues
Merge in Binomial Queues
DeleteMin in Binomial Queues
Binomial Queue Summary
Treap Dictionary Data Structure
Tree + Heap… Why Bother?
Treap Insert
Treap Delete
Treap Summary
Perfect Binary Skip List
Find in a Perfect Binary Skip List
Randomized Skip List Intuition
Randomized Skip List
Find in a RSL
Insertion in a RSL
Insertion Example in RSL
Range Queries and Iteration
Randomized Skip List Summary
What We Won’t Discuss
To Do
Coming Up
Email: owner-cse326@cs.washington.edu
Home Page: http://www.cs.washington.edu/326/
Download presentation source