题目大意:给出升序数组,根据数组构建平衡二叉搜索树
分析:dfs。由于数组是升序的,所以每次找到中间节点即为根节点,左侧就是二叉树的左子树,右侧就是二叉树的右子树,递归建树即可。有点类似二分法的感觉。由于每次都是平均分配,所以是平衡树。
代码:
/**
* 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* sortedArrayToBST(vector<int>& nums) {
return dfs(nums,0,nums.size() - 1);
}
TreeNode* dfs(vector<int>& nums,int left,int right){
if(left > right)
return NULL;
int mid = (left + right) / 2;
TreeNode* root = new TreeNode(nums[mid]);
root->left = dfs(nums,left,mid - 1);
root->right = dfs(nums,mid + 1,right);
return root;
}
};