【2022初春】【LeetCode】【树】563. 二叉树的坡度

感觉自己好像又明白一些啦

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int findTilt(TreeNode root) {
        if(root==null) return 0;
        int du = 0;
        du = Math.abs(path(root.left) - path(root.right));
        du += findTilt(root.left) + findTilt(root.right);
        return du;
    }
    int path(TreeNode root){ //当前节点及子节点的权值和
        int res = 0;
        if(root==null) return 0;
        res += root.val + path(root.left) + path(root.right);
        return res;
    }
}

虽然只是 简单题