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

Hello.I'm looking to implement a binary tree (traversal, sorting and the like)... Preferably without the use of recursion, because it's fscking complicated and it never bloody works. One more ...