1008. Construct Binary Search Tree from Preorder Traversal
因为二叉搜索树的中序遍历就是顺序的,所以也可以转化为已知先序和中序遍历的结果来构造二叉树
/**
* 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) {
if(preorder.empty()) return NULL;
vector<int>::iterator first = preorder.begin(), mid = preorder.begin();
first++;
mid++;
for(; mid != preorder.end() && *mid < preorder[0]; mid++);
TreeNode* root = new TreeNode(preorder[0]);
vector<int> leftPart(first, mid);
vector<int> rightPart(mid, preorder.end());
root->left = bstFromPreorder(leftPart);
root->right = bstFromPreorder(rightPart);
return root;
}
};