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:

The sum of node values in any subtree won’t exceed the range of 32-bit integer.
All the tilt values won’t exceed the range of 32-bit integer.

/**
这题其实要你求每个节点的左右子树的差的绝对值,再对这些绝对值求和.简单递归搜索,16ms AC
 * 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 sum = 0;

    int dfs(TreeNode *root)             //表示以root为根节点的所有子节点(包括本身)之和
    {
        if(root == NULL)
            return 0;
        int left = dfs(root->left), right = dfs(root->right);
        sum += abs(left-right);         //左右子树的差的绝对值
        return left+right+root->val;
    }
    int findTilt(TreeNode* root) {
        if(root == NULL)
            return 0;
        dfs(root);

        return sum;
    }
};