Key-ordered dict in Python

Question

I am looking for a solid implementation of an ordered associative array, that is, an ordered dictionary. I want the ordering in terms of keys, not of insertion order.

Answer 1

An ordered tree is usually better for this cases, but random access is going to be log(n). You should keep into account also insertion and removal costs...