Interview Question for Summer Internship at Facebook:

If we're only searching for a number in an unsorted array once, a simple iteration through the numbers has better runtime than a binary tree. Iteration is just O(n) while constructing the binary tree is O(nlogn).

I expect they're looking for those kinds of questions: is the array sorted? will we need to search for more numbers later?