想法:
要求高度平衡,则每次从最中间去取结点,
注意点:传引用,在同一个数组上使用,不用额外开辟空间占用内存。
code:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
private:
TreeNode* traversal(vector<int>& nums,int left,int right)
{
if(left>right)return NULL;
int mid=left+(right-left)/2;
TreeNode* newnode=new TreeNode(nums[mid]);
newnode->left=traversal(nums,left,mid-1);
newnode->right=traversal(nums,mid+1,right);
return newnode;
}
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root=traversal(nums,0,nums.size()-1);
return root;
}
};