Antoon Pardon <[EMAIL PROTECTED]> writes:
> The underlying implementation is an AVL balanced binary tree with
> inorder threading.
Dan Bernstein argues for switching from hash tables to crit-bit trees
(a/k/a Patricia trees), because of their guaranteed worst case
performance. He also claims:
"Crit-bit trees are faster than comparison-based structures such
as AVL trees and B-trees. They're also simpler, especially for
variable-length strings."
See:
http://cr.yp.to/critbit.html
See:
http://www.cs.rice.edu/~scrosby/hash/
for some stuff about the dangers of hash tables.
--
http://mail.python.org/mailman/listinfo/python-list
