776. Split BST

最新推荐文章于 2021-10-10 08:42:39 发布

原创最新推荐文章于 2021-10-10 08:42:39 发布 · 448 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

558 篇文章

订阅专栏

Tree

23 篇文章

订阅专栏

本文介绍了一种算法，用于将二叉搜索树（BST）根据指定值V拆分为两个子树，其中一个子树的所有节点值小于等于V，另一个大于V。通过递归方式调整树结构，保持大部分原始树结构不变。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

思路：递归的套路

# Definition for a binary tree node.
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    def splitBST(self, root, V):
        """
        :type root: TreeNode
        :type V: int
        :rtype: List[TreeNode]
        """
        if not root: return [None, None]
        l = self.splitBST(root.left, V)
        r = self.splitBST(root.right, V)
        
        if root.val>V:
            root.left = l[1]
            return [l[0], root]
        else:
            root.right = r[0]
            return [root, r[1]]
        
s=Solution()
root = TreeNode(4)
root.left = TreeNode(2)
root.left.left = TreeNode(1)
root.left.right = TreeNode(3)
root.right = TreeNode(6)
root.right.left = TreeNode(5)
root.right.right = TreeNode(7)
print(s.splitBST(root, 2))