Leetcode DAY 23:修剪二叉搜索树 and 将有序数组转换为二叉搜索树 and 把二叉搜索树转换为累加树

最新推荐文章于 2024-03-21 10:53:58 发布

Petal990912

最新推荐文章于 2024-03-21 10:53:58 发布

阅读量112

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/qq_44189622/article/details/128288334

版权

669. 修剪二叉搜索树

class Solution:
    def trimBST(self, root: Optional[TreeNode], low: int, high: int) -> Optional[TreeNode]:
        if not root: return None
        # 找到区间内节点
        if root.val < low:
            right = self.trimBST(root.right, low, high)
            return right
        if root.val > high:
            left = self.trimBST(root.left, low, high)
            return left
        # 替换节点
        root.left = self.trimBST(root.left, low, high)
        root.right = self.trimBST(root.right, low, high)
        return root

108.将有序数组转换为二叉搜索树

找到中间大小的数作为根节点数值递归遍历左半部分数和右半部分数

class Solution:
    def Traversal(self, nums:List[int], left: int, right: int):
        if left > right: return None
        mid = (left + right)//2
        root = TreeNode(nums[mid])
        root.left = self.Traversal(nums, left, mid - 1)
        root.right = self.Traversal(nums, mid + 1, right)
        return root

    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
        return self.Traversal(nums, 0, len(nums) - 1)

538.把二叉搜索树转换为累加树

class Solution:
    def __init__(self):
        self.pre = 0
    def convertBST(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        def Traversal(root: Optional[TreeNode]):
            if not root: return
            # 右中左
            Traversal(root.right)
            root.val += self.pre
            self.pre = root.val
            Traversal(root.left)

        Traversal(root)
        return root

遍历顺序右中左

把前一个结点的val累加到root.val