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:

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.

代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int findTilt(struct TreeNode* root) {
    int sum(struct TreeNode*);
    if(root==NULL)
        return 0;
    return abs(sum(root->left)-sum(root->right))+findTilt(root->left)+findTilt(root->right);
}
int sum(struct TreeNode* root)
{
    if(root==NULL)
        return 0;
    return root->val+sum(root->left)+sum(root->right);
}

其实就是递归进行求和，然后递归依次求每个节点的值就ok了

（其实那个值具体叫什么我也不是很清楚。。。）