title: How to build a binary tree in O(N ) time?
body: <p>Following on from a previous question <a href="https://stackoverflow.com/questions/35842055/finding-a-number-greater-than-x-in-a-range/35848683?noredirect=1#comment59367277_35848683">here</a> I'm keen to know how to build a binary tree from an array of N unsorted large integers in order N time?</p>