leetcode-108. 将有序数组转换为二叉搜索树

题目：

代码：

#include 
#include 
using namespace std;

struct TreeNode{
	int val;
	TreeNode *left,*right;
};

TreeNode* helper(vector& nums,int left,int right){
	if(left>right){
		return NULL;
	}
	int mid=(left+right)/2;
	TreeNode *root=new TreeNode;
	root->val=nums[mid];
	root->left=helper(nums,left,mid-1);
	root->right=helper(nums,mid+1,right);
	return root;
}

TreeNode* sortedArrayToBST(vector& nums) {
	return helper(nums,0,nums.size()-1);
}

int main(){
	TreeNode* res;
	vector nums;
	int n,tn;
	cin>>n;
	for(int i=0;i>tn;
		nums.push_back(tn);
	}
	res=sortedArrayToBST(nums);
	return 0;
}