<easy>LeetCode Problem -- 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

• 分析：给出一棵二叉树，要求求出这棵二叉树的差值，这棵二叉树的倾斜值为各个节点左右子树差值之和，每个节点的差值为左右子树差的绝对值。
• 思路一：递归，这道题在做的过程中很容易将差值计算成为单一左右节点的差，但其实这道题对于每一个节点要求的差值为左右子树的差值。每次对于节点的值进行更新，更新为左右节点之和。

class Solution {
public:
    int findTilt(TreeNode* root) {
        int left_part = 0;
        int right_part = 0;
        if (!root) return 0;
        int child = findTilt(root -> left) + findTilt(root -> right);
        if (root -> left) {
            root -> val += root -> left -> val;
            left_part = root -> left -> val;
        }
        if (root -> right) {
            root -> val += root -> right -> val;
            right_part = root -> right -> val;
        }
        return child + abs(left_part - right_part);
    }
};