/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* bstFromPreorder(vector<int>& preorder) {
TreeNode* root = NULL;
for(int i = 0;i<preorder.size();i++)
{
add(root,preorder[i]);
}
return root;
}
void add(TreeNode* &root,int val)
{
if(!root)
{
root = new TreeNode(val);
}
else
{
if(root->val>val) add(root->left,val);
else add(root->right,val);
}
}
};