/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/classSolution{int result =0;publicintfindTilt(TreeNode root){sum(root);return result;}privateintsum(TreeNode root){if(root == null){return0;}int l =sum(root.left);int r =sum(root.right);
result += Math.abs(l - r);return l + r + root.val;}}