LeetCode:42.将有序数组转化为二叉搜索树

目录

1.将有序数组转化为二叉搜索树

---

1.将有序数组转化为二叉搜索树

class Solution {
public:TreeNode* createTree(vector<int>& nums, int left, int right){if(left > right) return nullptr;int mid = left + (right - left) / 2;TreeNode* root = new TreeNode(nums[mid]);root->left = createTree(nums, left, mid - 1);root->right = createTree(nums, mid + 1, right);return root;}TreeNode* sortedArrayToBST(vector<int>& nums) {return createTree(nums, 0, nums.size() - 1);}
};