## Creating a balanced binary search tree from sorted array

Given a sorted array, how do we create binary search which height balanced. For example the array [1,2,3,4,5] must be transformed to the following binary tree 3 / 2 4 / 1 5 We can use the divide and conquer approach to solve this problem. To create a…