3 Consider Building Full Binary Search Tree Bst Sorted Array N 2 1 Recall 2 1 Elements Rem Q37075873

3. Consider building a full Binary Search Tree, BST, from a sorted array of n 2-1. Recall that if we have 2-1 elements and we remove the middle element, the two remaining parts will have 211 elements each. We will insert the middle array element first (it will become the root), then insert the middle element of the left half, then the middle element of the right half, and so on recursively. (a)

OR

 

OR