563. Binary Tree Tilt
class Solution {
int res;
public int findTilt(TreeNode root) {
res=0;
dfs(root);
return res;
}
public int dfs(TreeNode root){
if(root==null){
return 0;
}
int l=dfs(root.left);
int r=dfs(root.right);
res=res+Math.abs(l-r);
return l+r+root.val;
}
}