Binary Tree Tilt

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

Input: 
         1
       /   \
      2     3
    4     5
则计算方式为：4作为2的tilt；5作为3的tilt。(2+4)-(3+5)=2作为1的tilt。最后输出4+5+2=11

注意并不是简单地计算每个的两个左右孩子差，再求和。

而是计算左后孩子的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 {
public:
    int findTilt(TreeNode* root) {
        if(!root){
            return 0;
        }
        int tilt=0; 
        subTreeSum(root,tilt);
        return tilt;
    }
    int subTreeSum(TreeNode* root,int& tiltSum){
        if(!root){
            return 0; 
        }
        int leftSum = subTreeSum(root->left,tiltSum);
        int rightSum = subTreeSum(root->right,tiltSum);
        tiltSum += abs(leftSum-rightSum);
        return leftSum + rightSum + root->val;        
    }
};