根据二叉搜索树的特点，如果一个节点的值小于等于目标数，那么它的左子树所有节点都小于目标数；如果节点值大于目标数，那么它的右子树所有节点都大于目标数。因此可以分成以下两种情况来分析。
Given the root of a binary search tree (BST) and an integer target, 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 Is not necessarily the case that the tree contains a node with the value target.
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.
Return an array of the two roots of the two subtrees.
Example 1:
Input: root = [4,2,6,1,3,5,7], target = 2
最低0.47元/天 解锁文章
583
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
