11-18每日一题：563. 二叉树的坡度

563. 二叉树的坡度

思路：递归

遍历一遍结点，返回以当前结点为根结点的权值总和，每一次遍历过程中更新答案

时间复杂度：$O(n)$

空间复杂度：$O(h)$树的深度

/**
 * 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 res = 0;
    int findTilt(TreeNode* root) {
        dfs(root);
        return res;
    }

    int dfs(TreeNode* root) {
        if (!root) return 0;
        int left = dfs(root->left);
        int right = dfs(root->right);
        res += abs(left - right)
        return left + right + root->val;
    }
};