LeetCode Convert Sorted Array to Binary Search Tree

来源:互联网 发布:淘宝企业号注册 编辑:程序博客网 时间:2024/06/18 07:32

题目:

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

/** * Definition for binary tree * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    TreeNode *sortedArrayToBST(vector<int> &num) {    TreeNode *root = create(num, 0, num.size()-1);    return root;     }private:TreeNode *create(vector<int> &num, int begin, int end) {if(begin <= end) {int mid = begin + (end-begin)/2;TreeNode *root = new TreeNode(num[mid]);root->left = create(num, begin, mid-1);root->right = create(num, mid+1, end);return root;}else return NULL;}};


0 0