[LeetCode] 776. Split BST
Problem
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:
The size of the BST will not exceed 50.
The BST is always valid and each node's value is different.
Solution
class Solution {
public TreeNode[] splitBST(TreeNode root, int V) {
TreeNode[] res = new TreeNode[2];
if (root == null) return res;
if (root.val <= V) {
res[0] = root;
TreeNode[] rightRes = splitBST(root.right, V);
root.right = rightRes[0];
res[1] = rightRes[1];
} else {
res[1] = root;
TreeNode[] leftRes = splitBST(root.left, V);
root.left = leftRes[1];
res[0] = leftRes[0];
}
return res;
}
}
Road to Glory
[LeetCode] 958. Check Completeness of a Binary Tree
linspiration阅读 1.9k
Java8的新特性
codecraft赞 32阅读 27.5k评论 1
一文彻底搞懂加密、数字签名和数字证书!
编程指北赞 71阅读 33.7k评论 20
Java11的新特性
codecraft赞 28阅读 19.3k评论 3
Java5的新特性
codecraft赞 13阅读 21.8k
Java9的新特性
codecraft赞 20阅读 15.4k
Java13的新特性
codecraft赞 17阅读 11.2k
**粗体** _斜体_ [链接](http://example.com) `代码` - 列表 > 引用
。你还可以使用@
来通知其他用户。