LeetCode #776. Split BST

题目描述：

Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes that are all smaller or equal to the target value, while the other subtree has all nodes that are greater than the target value.  It's not necessarily the case that the tree contains a node with value V.

Additionally, most of the structure of the original tree should remain.  Formally, for any child C with parent P in the original tree, if they are both in the same subtree after the split, then node C should still have the parent P.

You should output the root TreeNode of both subtrees after splitting, in any order.

Example 1:

Input: root = [4,2,6,1,3,5,7], V = 2
Output: [[2,1],[4,3,6,null,null,5,7]]
Explanation:
Note that root, output[0], and output[1] are TreeNode objects, not arrays.

The given tree [4,2,6,1,3,5,7] is represented by the following diagram:

          4
        /   \
      2      6
     / \    / \
    1   3  5   7

while the diagrams for the outputs are:

          4
        /   \
      3      6      and    2
            / \           /
           5   7         1

Note:

1. The size of the BST will not exceed 50.
2. The BST is always valid and each node's value is different.

class Solution {
public:
    vector<TreeNode*> splitBST(TreeNode* root, int V) {
        if(root==NULL) return {NULL,NULL};
        // 显然是用递归，但是递归的方法需要注意
        // 返回两个节点第一个是小于等于V的BST，第二个是大于V的BST
        // 根据根的值判断需要分裂哪一个子树，返回分裂结果后再更新root
        if(V==root->val)
        {
            TreeNode* right=root->right;
            root->right=NULL;
            return {root,right};
        }
        else if(V>root->val)
        {
            vector<TreeNode*> v=splitBST(root->right,V);
            root->right=v[0];
            return {root,v[1]};
        }
        else
        {
            vector<TreeNode*> v=splitBST(root->left,V);
            root->left=v[1];
            return {v[0],root};
        }
    }
};