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

Both maps and sets are implemented based on red-black trees. A red-black tree is a self-balancing binary search tree that ...