A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees

We suggest a new non-recursive algorithm for constructing binary search tree given an array of numbers. The has $O(N)$ time and $O(1)$ memory complexity if the $N$ numbers is sorted. resulting minimal height can be transformed to complete (retaining height) with $O(\log N)$ memory. allows simple effective parallelization.