leetcode之Convert Sorted Array to Binary Search Tree

题目大意:

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

意思就是:

同Convert Sorted List to Binary Search Tree, 只是把List换成了Array, 思路相同.

代码如下:

/**
 * 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) {
        	vector<int>::size_type length = num.size();
			if(length == 0){
				return NULL;
			}
			if(length==1){
				TreeNode* node = new TreeNode(num[0]);
				return node;
			}
			TreeNode* root = new TreeNode(num[length/2]);
			TreeNode* leftT = dfsTravel(root, num, 0, length/2-1);
			root->left = leftT;
			TreeNode* rightT = dfsTravel(root, num, length/2+1, length-1);
			root->right = rightT;
			return root;
    }
    	TreeNode* dfsTravel(TreeNode* node, vector<int>& storage, int start, int end){
			if(end>=start){
				TreeNode* result = new TreeNode(storage[(end+1-start)/2+start]);
				TreeNode* leftT = dfsTravel(result, storage, start, (end-start+1)/2-1+start);
				result->left = leftT;
				TreeNode* rightT = dfsTravel(result, storage, (end-start+1)/2+1+start, end);
				result->right = rightT;
				return result;
			}
			else if(end < start){
				return NULL;
			}
		}
};