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;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int ans = 0;
    int findTilt(TreeNode* root) {
        if (root == NULL) return 0;
        solve(root);
        return ans;
    }
    int solve(TreeNode* root) {
        if (root == NULL) return 0;
        int left = solve(root->left);
        int right = solve(root->right);
        ans += abs(left - right);
        return left + right + root->val;
    }
};