1 research outputs found
A fast algorithm for constructing balanced binary search trees
We suggest a new non-recursive algorithm for constructing a binary search
tree given an array of numbers. The algorithm has time and memory
complexity if the given array of numbers is sorted. The resulting tree is
of minimal height and can be transformed to a complete binary search tree
(retaining minimal height) with time and memory.
The algorithm allows simple and effective parallelization