Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However inserting ...

I'm ashamed to admit that as a programmer I've never worked with binary data.<BR>Anyway, now that that's out of the way...<BR><BR><BR>I know you can do simple ...