Gnarley trees

Introduction (current)
Ordered dictionaries
Introduction Naïve solutions Applications Binary search tree Balancing trees AVL tree 2-3 tree 2-3-4 tree B tree Red-black tree AA tree Skiplist Treap Splay tree Scapegoat tree
Priority queues
Introduction Naïve solutions Applications Heap d-ary heap Leftist heap Skew heap Pairing heap Binomial heap Lazy binomial heap Fibonacci heap
Union-find
Introduction Naïve solutions Union find
Stringology
Introduction Trie Suffix tree
Preliminaries
Different notions of complexity

Naïve solutions

Fast find

Idea:	recolor
Advantages:	fast find
Disadvantages:	slow union

Fast union

Idea:	link
Advantages:	fast union
Disadvantages:	slow find