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.

Iteration over a sorted binary tree using recursive descent in an enumeration method. By Kevlin Henney ; September 24, 2001; Patterns in Java A tale of three patterns by Kevlin Henney Listing 1.