563. Binary Tree Tilt（python+cpp）

题目：

Given a binary tree, return the tilt of the whole tree.
The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.
The tilt of the whole tree is defined as the sum of all nodes’ tilt.

Example:

Input: 
         1
       /   \
      2     3 
Output: 1 
Explanation:  
Tilt of node 2 : 0 
Tilt of node 3 : 0 
Tilt of node 1 : |2-3| = 1 
Tilt of binary tree : 0 + 0 + 1 = 1

Note:
The sum of node values in any subtree won’t exceed the range of 32-bit integer.
All the tilt values won’t exceed the range of 32-bit integer.

解释：
对于这种问题，一定要避免重复计算。在遍历的过程中就更新总和。遍历的过程中返回值是该结点所在的子树的所有结点的值的总和。
python代码：

# 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 findTilt(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.sum=0
        def getSum(root):
            left=0
            right=0
            if root==None:
                return 0
            if root.left!=None:
                left=getSum(root.left)
            if root.right!=None:
                right=getSum(root.right)
            self.sum+=abs(left-right)
            return root.val+left+right
        getSum(root)
        return self.sum

c++代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
#include <cmath>
class Solution {
public:
    int _sum=0;
    int findTilt(TreeNode* root) {
        if (root)
            getSum(root);
        return _sum;
    }
    int getSum(TreeNode* root)
    {
        int left=0,right=0;
        if(root->left)
            left=getSum(root->left);
        if(root->right)
            right=getSum(root->right);
        _sum+=abs(left-right);
        return root->val+left+right;
    }
};

总结：
对于dfs的问题，最后返回的值不一定是需要的值，但是可以在递归的过程中更新结果。