/**
* 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 nullptr;
int mid = left + (right - left) / 2;
TreeNode *root = new TreeNode(nums[mid]);
root -> left = traversal(nums,left,mid - 1);
root -> right = traversal(nums,mid + 1,right);
return root;
}
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root = traversal(nums, 0, nums.size() - 1);
return root;
}
};
力扣-108.将有序数组转换为二叉树
最新推荐文章于 2024-10-04 14:10:29 发布
文章介绍了如何使用C++实现一个Solution类,通过递归方法`traversal`将给定的有序整数数组转换为一个平衡的二叉搜索树(BST),并通过`sortedArrayToBST`函数构建BST的根节点。
摘要由CSDN通过智能技术生成