item access time: sets v. lists

Duncan Booth duncan.booth at invalid.invalid
Wed Oct 4 14:59:06 EDT 2006


"Paul McGuire" <ptmcg at austin.rr._bogus_.com> wrote:

> By contrast, a set (and also the keys in a dict) use a tree structure
> to index more quickly into the list of items

'dict' and I believe also 'set' use a hash table, not a tree structure.



More information about the Python-list mailing list