day21: 二叉树-补卡

Leetcode 530. Minimum Absolute Difference in BST

class Solution:
    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
        values = []
        def dfs(root):
            if root==None: return
            values.append(root.val)
            dfs(root.left)
            dfs(root.right)
            return values
        values = dfs(root)
        n = len(values)
        values.sort()
        min_diff = float('inf')
        for i in range(n-1):
            min_diff = min(min_diff, abs(values[i]-values[i+1]))
        return min_diff

Leetcode 501. Find Mode in Binary Search Tree

class Solution:
    def findMode(self, root: Optional[TreeNode]) -> List[int]:
        from collections import Counter
        values = Counter()
        max_freq = 0
        def dfs(root):
            nonlocal max_freq
            if root==None: return
            values[root.val]+=1
            max_freq = max(max_freq, values[root.val])
            dfs(root.left)
            dfs(root.right)
            return values , max_freq
        values, max_freq = dfs(root)
        return [num for num in values if values[num] == max_freq]

Leetcode 236. Lowest Common Ancestor of a Binary Tree

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if not root or root == p or root == q:
            return root
        
        left = self.lowestCommonAncestor(root.left, p, q)
        right = self.lowestCommonAncestor(root.right, p, q)
        
        if left and right:
            return root
        if left:
            return left
        return right