【算法题】求二叉树所有节点的左右子树的绝对值差的和

题目描述：

leetcode 563. Binary Tree Tilt：
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.

参考博客。

解决方法：

——本题目关键在于求出每个节点的左右子树的绝对值差，再将所有节点的绝对值差加起来。

——C++代码：

struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) :val(x), left(NULL), right(NULL){}
};
class Solution40_1 {
public:
        int sum = 0;
        int sum_all(TreeNode *root)
        {
            if (root==NULL)
            {
                return 0;
            }
            int left = sum_all(root->left);//左子树之和
            int right = sum_all(root->right);//右子树之和
            sum = sum + abs(left - right);//累计左右子树的绝对差
            return left + right + root -> val;//返回该节点作为子树的所有值之和
        }
        int findTilt(TreeNode* root) {
            sum_all(root);
            return sum;
        }
};

——Python代码：

class TreeNode(object):
    def __init__(self,x):
        self.val=x
        self.left=None
        self.right=None

class Solution(object):
    def findTilt(self, root):
        self.sum=0  
        def sum_all(root):
            if root==None:
                return 0
            left=sum_all(root.left)
            right=sum_all(root.right)
            self.sum=self.sum+abs(left-right)
            return left+right+root.val        
        sum_all(root)
        return self.sum