1026. Maximum Difference Between Node and Ancestor

Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val - B.val| and A is an ancestor of B.

(A node A is an ancestor of B if either: any child of A is equal to B, or any child of A is an ancestor of B.)

 

Example 1:

Input: [8,3,10,1,6,null,14,null,null,4,7,13]
Output: 7
Explanation: 
We have various ancestor-node differences, some of which are given below :
|8 - 3| = 5
|3 - 7| = 4
|8 - 1| = 7
|10 - 13| = 3
Among all possible differences, the maximum value of 7 is obtained by |8 - 1| = 7.

 

Note:

1. The number of nodes in the tree is between 2 and 5000.
2. Each node will have value between 0 and 100000.

思路：子树收集min,max

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

class Solution(object):
    def maxAncestorDiff(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.max = 0
        
        def min_max_of_child(r):
            if not r.left and not r.right: return r.val,r.val
            
            mi,ma = r.val,r.val
            if r.left:
                l_min, l_max = min_max_of_child(r.left)
                mi,ma = min(mi,l_min),max(ma,l_max)
            if r.right:
                r_min, r_max = min_max_of_child(r.right)
                mi,ma = min(mi,r_min),max(ma,r_max)
            
            self.max = max(self.max, abs(mi-r.val), abs(ma-r.val))
            
            return mi,ma
            
        min_max_of_child(root)
        return self.max