没看答案。
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def trimBST(self, root: Optional[TreeNode], low: int, high: int) -> Optional[TreeNode]:
if not root:
return None
# 根和左子树都会小于low,直接考虑右子树
if root.val < low:
root = root.right
return self.trimBST(root, low, high)
# 根和右子树都会大于high,直接考虑左子树
elif root.val > high:
root = root.left
return self.trimBST(root, low, high)
# 左右子树都要看情况修建
else:
left = root.left
root.left = self.trimBST(left, low, high)
right = root.right
root.right = self.trimBST(right, low, high)
return root