Building a balanced binary search tree given a sorted array as input. Note: this should not use the insert operation, the tree must be built directly from the array in O(n) time. 3) 4) Extracting the elements in a binary search tree into a sorted array. As above, this should be done in O(n) time