leetcode tree of good ideas（树）

题目1：Convert Sorted Array to Binary Search Tree（树，递归算法）

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

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

others good idea，very nice

class Solution {
	TreeNode * sortedArrayToBSTHelper(vector<int> &nums, int start, int end)//递归的想法，很nice！
	{
		if(start >= end)
			return NULL;
		int mid = (start+end)/2;
		TreeNode * curr = new TreeNode(nums[mid]);
		curr->left = sortedArrayToBSTHelper(nums, start, mid);
		curr->right = sortedArrayToBSTHelper(nums, mid+1, end);

		return curr;
	}
public:
	TreeNode* sortedArrayToBST(vector<int>& nums) {

		return sortedArrayToBSTHelper(nums, 0, nums.size());
		//参数是nums.size(),不是nums.size()-1;
	}
};