2017算法课.12（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

这道题其实是要求 求出各个节点左右子树的差的绝对值，将这些绝对值求和并返回。 
左右子树的差 = | 左子树所有节点的值的和 - 右子树所有节点的值的和 | 

利用递归，分别求出左子树的tilt和右子数的tilt，然后绝对值做差。

代码如下：

class Solution {
public:
    int findTilt(TreeNode* root) {
        if(root == NULL) return 0;
        
        int res = 0;
        
        postorder(root, res);
        
        return res;
    }
private:
    int postorder(TreeNode* root, int& res){
        if(root == NULL) return 0;
        
        int leftsum= postorder(root->left,res);
        
        int rightsum = postorder(root->right,res);
        
        res += abs(leftsum - rightsum);
        
        return leftsum + rightsum + root->val;
        
    }
};