CPSC 320: Intermediate Algorithm Design & Analysis Splay Trees (for Amortized Analysis) Steve Wolfman 1

Splay Trees Problems with AVL Trees –extra storage/complexity for height fields –ugly delete code Solution: splay trees –blind adjusting version of AVL trees –amortized time for all operations is O(log n) –worst case time is O(n) –insert/find always rotates node to the root!

Idea You’re forced to make a really deep access: Since you’re down there anyway, fix up a lot of deep nodes!

Zig-Zig n Z Y p X g W g W X p Y n Z

Zig-Zag g X p Y n Z W n Y g W p ZX

Zig p X n Y Z n Z p Y X root

Splaying Example Find(6) zig-zig

Still Splaying 6 zig-zig

Almost There, Stay on Target zig

Splay Again Find(4) zig-zag

Example Splayed Out zig-zag

How do you actually do Insert/Delete? You do a splay or two plus some slightly tricky stuff that’s still far easier than AVL, 2-3, B, B+, or Red-Black trees. Not especially relevant here.