1008. Construct Binary Search Tree from Preorder Traversal

https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/

Return the root node of a binary search tree that matches the given preorder traversal.

(Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right has a value > node.val.  Also recall that a preorder traversal displays the value of the node first, then traverses node.left, then traverses node.right.)

It's guaranteed that for the given test cases there is always possible to find a binary search tree with the given requirements.

Example 1:

Input: [8,5,1,7,10,12]
Output: [8,5,10,1,7,null,12]

Constraints:

• 1 <= preorder.length <= 100
• 1 <= preorder[i] <= 10^8
• The values of preorder are distinct.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

---

算法思路：

就是知道前序遍历和中序遍历来构建二叉树的变形，我们这里没有直接给出中序遍历，但是告诉我们要构建二叉搜索树，这也就告诉了我们中序遍历，并且我们还不用构建中序遍历序列，因为直接使用前序遍历进行分割即可，更为简单，代码一遍过哈。

class Solution { //根-左-右
public:
    TreeNode* bstFromPreorder(vector<int>& preorder) {
        return buildBST(preorder, 0, preorder.size() - 1);
    }
private:
    TreeNode* buildBST(vector<int>& preorder, int start, int end) {
        if (start > end) return nullptr;
        if (start == end) return new TreeNode(preorder[start]);
        
        TreeNode* root = new TreeNode(preorder[start]);
        int i;
        for (i = start + 1; i <= end; i++) {
            if (preorder[i] > preorder[start]) break;
        }
        root->left = buildBST(preorder, start + 1, i - 1);
        root->right = buildBST(preorder, i, end);
        
        return root;
    }
};