On the Python datastructures:
Datastructures of Some Interest
Datastructure Implementations for Python
(When there's more time) I'd like to do a comparison of Heaps as well, including trees and treaps in heap-like usage.
My comparison of just the trees (and treap)
, in case you want to check my methodology, etc.
Comparison of binary search trees
Skip Lists compared with Treaps and Red-Black Trees
AVL Tree: Comparison to other data structures
Another performance comparison
xkzou on Red-Black trees
xkzou on other search trees
Heap (data structure)
described on wikipedia
to Dan's tech tidbits
You can e-mail the author with questions or comments: