Binary Tree Tilt LeetCode solution in Java

1
class Solution {
2
  int max = 0;
3

4
  public int findTilt(TreeNode root) {
5
    loop(root);
6
    return max;
7
  }
8

9
  public int loop(TreeNode root) {
10
    if (root == null) return 0;
11
    int left = loop(root.left);
12
    int right = loop(root.right);
13
    max += Math.abs(left - right);
14
    return root.val + left + right;
15
  }
16
}