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     3Output: 1Explanation: Tilt of node 2 : 0Tilt of node 3 : 0Tilt of node 1 : |2-3| = 1Tilt 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 res =0;    int findTilt(TreeNode* root) {        sumTilt(root);        return res;    }private:    int sumTilt(TreeNode* root)    {        if(root==NULL)            return 0;        int left = sumTilt(root->left);        int right = sumTilt(root->right);        res += abs(left - right);         return left+right+root->val;    }};