【leetcode 二叉树 C++】563. Binary Tree Tilt

563. Binary Tree Tilt

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int calSum(TreeNode* root, int &tilt) {
        if(!root) return 0;
        int left_sum = 0, right_sum = 0;
        if(root->left) left_sum = calSum(root->left, tilt);
        if(root->right) right_sum = calSum(root->right, tilt);
        tilt += abs(left_sum - right_sum);
        return left_sum + right_sum + root->val;
    }
    int findTilt(TreeNode* root) {
        int tilt = 0;
        calSum(root, tilt);
        return tilt;
    }
};