SJS wrote: > Yes. I love trees and recursion. Nasty hash-tables give us O(1) access > for the win, but trees are things of beauty nevertheless. :) > Yes, hash-tables give us O(1) access... unless you want sorted access. ;-)
Oh, and what do you do if you have a hash collision? Oh, you store the collided entries in a tree or sorted list. ;-) What do you do to speed up traversal of a tree? Well, you increase the number of child nodes for every parent and use some kind of a hash to determine which path to take..... Tree and hashes are nice, pure CS concepts. In real world implementation hell, your optimal solution tends to be neither one nor the other but a mixture of both. --Chris -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
