Binary code is the perfect place to start — it's conceptually simple but practically complex, and to computers, it's everything.

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 ...