1

It doesn't significantly increase the speed, the increase will just be a constant at best. Essentially, you still search the same tree, just in a different ordering, and that means you will still do $O(\log(n))$ operations to search a number. It might be useful to think of this as just two separate BSTs, one for odd numbers and one for even numbers. So, this ...


Only top voted, non community-wiki answers of a minimum length are eligible