Split BST
Problem:
Given a Binary Search Tree (BST) with root node root, and a target value V, split...for any child C with parent P in the original tree, if they are both in the same subtree after the split...Example 1:
Input: root = [4,2,6,1,3,5,7], V = 2
Output: [[2,1],[4,3,6,null,null,5,7]]
Explanation...The given tree [4,2,6,1,3,5,7] is represented by the following diagram:
4
/ \
2...2. 根据val划分两个子输入顺序
3.