[Leetcode] Convert Sorted Array to Binary Search Tree

Given an array where elements is sorted in ascending order, convert it to a height balanced BST.

This problem requires the creation of a binary sort tree based on an ordered array.

Using the idea of binary, we construct the root node, and then construct the left and right subtree recursively. A recursive exit is an array that contains only one element.

TreeNode *sortedarraytobst ( vector<int>&num) {if(!num.size ())returnNULL;returnBuildbst (NUM,0, Num.size ()-1); } treenode* Buildbst ( vector<int>NumintLintR) {if(L <= R) {intMid = (L + r)/2; treenode* root =NewTreeNode (Num[mid]); Root->left = Buildbst (num, L, mid-1); Root->right = Buildbst (num, mid +1, R);returnRoot }Else            returnNULL; }

[Leetcode] Convert Sorted Array to Binary Search Tree