# 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) {
vector<TreeNode*> res{NULL, NULL};
if (!root) return res;
if (root->val <= V) {
res = splitBST(root->right, V);
root->right = res[0];
res[0] = root;
} else {
res = splitBST(root->left, V);
root->left = res[1];
res[1] = root;
}
return res;
}
};
``````

Delete Node in a BST

https://leetcode.com/problems/split-bst/solution/

https://leetcode.com/problems/split-bst/discuss/113798/C++Easy-recursion-in-O(n)

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation