Write an algorithm that combines 2 binary search trees into a single sorted array without sorting the array. In other words, each element should be taken from a tree and placed into its sorted position in the array. Provide the run time.