leetcode【108】Convert Sorted Array to Binary Search Tree

问题描述：

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

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

源码：

递归大法。时间还行（95%），空间sele（24%）。

/**
 * 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:
    TreeNode* help(vector<int>& nums, int left, int right){
        // cout<<left<<" "<<right<<endl;
        if(left == right)   return new TreeNode(nums[right]);
        if(left > right)    return NULL;
        int med = (left+right)/2;
        TreeNode* root = new TreeNode(-1);
        root->val = nums[med];
        root->left = help(nums, left, med-1);
        root->right = help(nums, med+1, right);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        int n = nums.size();
        if(n==0)    return NULL;
        return help(nums, 0, n-1);
    }
};

再来看看非递归的：

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {       
        int n = nums.size();
        if(n==0)    return NULL;
        TreeNode* root = new TreeNode(-1);
        queue<pair<int, int>> interval;
        queue<TreeNode*> node;
        interval.push(make_pair(0, nums.size()));
        node.push(root);
        while(!interval.empty()){
            auto interval_tmp = interval.front();
            interval.pop();
            auto node_tmp = node.front();
            node.pop();
            int med = (interval_tmp.first + interval_tmp.second)/2;
            node_tmp->val = nums[med];
            if(med > interval_tmp.first){
                node_tmp->left = new TreeNode(-1);
                interval.push(make_pair(interval_tmp.first, med));
                node.push(node_tmp->left);
            }
            if(med < interval_tmp.second-1){
                node_tmp->right = new TreeNode(-1);
                interval.push(make_pair(med+1, interval_tmp.second));
                node.push(node_tmp->right);
            }
        }
        return root;
    }
};