Binary Tree Tilt

Given a binary tree, return the tilt of the whole tree.

The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.

The tilt of the whole tree is defined as the sum of all nodes' tilt.

Example:

Input: 
         1
       /   
      2     3
Output: 1
Explanation: 
Tilt of node 2 : 0
Tilt of node 3 : 0
Tilt of node 1 : |2-3| = 1
Tilt of binary tree : 0 + 0 + 1 = 1

Note:

1. The sum of node values in any subtree won't exceed the range of 32-bit integer.
2. All the tilt values won't exceed the range of 32-bit integer.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private int tilt = 0;
    
    public int findTilt(TreeNode root) {
        subtreeSum(root);
        return tilt;
    }
    
    private int subtreeSum(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return root.val;
        
        int leftSum = subtreeSum(root.left);
        int rightSum = subtreeSum(root.right);
        tilt += Math.abs(leftSum - rightSum);
        return root.val + leftSum + rightSum;
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int findTilt(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return 0;
        
        int myTilt = findNodeTilt(root);
        return myTilt + findTilt(root.left) + findTilt(root.right);
    }
    
    public int findNodeTilt(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return 0;
        int leftSum = subtreeSum(root.left);
        int rightSum = subtreeSum(root.right);
        
        return Math.abs(leftSum - rightSum);
    }
    
    private int subtreeSum(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return root.val;
        
        return root.val + subtreeSum(root.left) + subtreeSum(root.right);
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private HashMap<TreeNode, Integer> treeSum;
    
    public int findTilt(TreeNode root) {
        treeSum = new HashMap<TreeNode, Integer>();
        subtreeSum(root);
        return findTiltHelper(root);
    }
    
    private int findTiltHelper(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return 0;
        
        int myTilt = findNodeTilt(root);
        return myTilt + findTiltHelper(root.left) + findTiltHelper(root.right);
    }
    
    public int findNodeTilt(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return 0;
        int leftSum = treeSum.containsKey(root.left) ? treeSum.get(root.left) : 0;
        int rightSum = treeSum.containsKey(root.right) ? treeSum.get(root.right) : 0;
        
        return Math.abs(leftSum - rightSum);
    }
    
    private int subtreeSum(TreeNode root) {
        if (root == null) {
            treeSum.put(root, 0);
            return 0;
        }
        if (root.left == null && root.right == null) {
            treeSum.put(root, root.val);
            return root.val;
        }
        if (treeSum.containsKey(root)) return treeSum.get(root);
        
        int leftSum = subtreeSum(root.left);
        int rightSum = subtreeSum(root.right);
        int sum = root.val + leftSum + rightSum;
        treeSum.put(root, sum);
        return sum;
    }
}