Is there an algorithm that builds from any series of n members a binary search tree (not necessarily balanced) in O(n^2)?
