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.

Arrays and Lists: Binary search is most effective with static datasets where the elements are pre-sorted. In cases of dynamic data, frequent sorting may be necessary, which can reduce its overall ...