LeetCode-Convert Sorted Array to Binary Search Tree

来源:互联网 发布:windows xp原装正版iso 编辑:程序博客网 时间:2024/06/06 17:16

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

Solution:

Code:

<span style="font-size:14px;">/** * 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 *helper(const vector<int> &num, int begin, int end) {        if (begin > end) return NULL;        int mid = (begin+end)/2;        TreeNode *root = new TreeNode(num[mid]);        root->left = helper(num, begin, mid-1);        root->right = helper(num, mid+1, end);        return root;    }        TreeNode *sortedArrayToBST(vector<int> &num) {        return helper(num, 0, num.size()-1);    }};</span>


0 0
原创粉丝点击