leetcode 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.
Note:

1、The sum of node values in any subtree won’t exceed the range of 32-bit integer.
2、All the tilt values won’t exceed the range of 32-bit integer.
题意：二叉树上节点的tilt是该节点左子树节点值之和减去右子树节点值之和的绝对值，二叉树的tilt是二叉树上所有节点的tilt之和，求二叉树的tilt。

使用递归，方法如下：

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