LeetCode 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.

题解，此题时要计算某一个节点的所有左子树和右子树的节点和的绝对值差，也就是计算某一个节点的所有左子树节点的和，以及所有右子树节点的和，然后计算这两个和的差的绝对值，将这棵二叉树的所有节点都计算一遍，将所有这些节点的左右子树节点和的绝对值相加，输出答案。很简单，考虑递归先序遍历，将这棵二叉树的所有节点都求和，然后分别计算相关的相关的差的绝对值；然后再将这些差值相加。

public class findTilt
{
    public int findTilt(TreeNode root)    
    {
        if(root == null)
            return 0;
        else         //递归求所有节点和的差的绝对值
            return abs(sort(root.left) - sort(root.right)) + findTilt(root.left) + findTilt(root.right);
    }
    public int sort(TreeNode root)   //递归求所有节点和
    {
        if(root == null)
            return 0;
        else
            return root.val + sort(root.left) + sort(root.right);
    }
}