Convert a sorted array to a Balanced Binary Search Tree.Node *SortedArrayToBST(int *arr, int start, int end)
{
if (start > end)
return nullptr;
int mid = start + (end - start) / 2;
Node *n = new Node();
n->value = arr[mid];
n->left = SortedArrayToBST(arr, start, mid - 1);
n->right = SortedArrayToBST(arr, mid + 1, end);
return n;
} |