• Datastructures of Some Interest
• Datastructure Implementations for Python
• On why I am not graphing red-black trees in the final version
• A preliminary comparison of just the trees (and treap)
• (When there's more time) I'd like to do a comparison of Heaps as well, including trees and treaps in heap-like usage.
• Code, in case you want to check my methodology, etc.

• xkzou on Red-Black trees
• xkzou on other search trees
• Comparison of binary search trees
• AVL Tree: Comparison to other data structures
• Heap (data structure) described on wikipedia
• Another performance comparison - albeit with slightly different results.

You can e-mail the author with questions or comments: