108.leetcode Convert Sorted Array to Binary Search Tree(medium)[数组 二分查找 二叉平衡搜索树]

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

把一个升序数组转换成平衡二叉搜索树，整个过程相当于二分查找，mid为根节点，左边的数组生成的新的平衡二叉搜索树为树的左子树，右边为右子树。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void printVector(vector<int>& num)
    {
        for(int i=0;i<num.size();i++)
        cout<<num[i]<<" ";
        cout<<endl;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        //根据观察可以知道排好序的数组转换成平衡二叉树的过程其实类似于二分查找
        int n= nums.size();
        if(n==0) return NULL;
        if(n==1) return new TreeNode(nums[0]);
        //cout<<"n:"<<n<<endl;
        n = n-1;
        int mid = 0;
        if((n&0x1)== 1) mid = (n+1)/2;
        else mid = n/2;
        TreeNode *root = new TreeNode(nums[mid]);
        vector<int> lnum(nums.begin(),nums.begin()+mid);
        //printVector(lnum);
        root->left = sortedArrayToBST(lnum);
        vector<int> rnum(nums.begin()+mid+1,nums.end());
        //printVector(rnum);
        root->right = sortedArrayToBST(rnum);
        return root;
    }
};