**Leetcode 776. Split BST

https://leetcode.com/contest/weekly-contest-70/problems/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) {
        return dfs(root, root, V);
    }
    
    vector<TreeNode*> dfs(TreeNode* real_root, TreeNode* root, int V) {
        vector<TreeNode*> ret;
        if(root== NULL) {
            ret.push_back(NULL);
            ret.push_back(NULL);
            return ret;
        }
        if (root->val <= V ) {
            ret.push_back(real_root);
            ret.push_back(NULL);
            return ret;
        }
        
        if (root->left) {
            if (root->left->val <= V) {
                TreeNode* tmp = root->left;
                root->left = root->left->right;
                tmp->right = NULL;
                ret.push_back(real_root);
                ret.push_back(tmp);
                return ret;
            } else {
                return dfs(real_root, root->left, V);
            }
        }  else {
            ret.push_back(real_root);
            ret.push_back(NULL);
            return ret;
        }
        return ret;
    }
};