leetcode 563. 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.

我的方法是递归，从根递归到叶，得到每个结点左子树所有结点的和，每个结点右子树所有结点的和，再相减取绝对值。

package leetcode;

public class Binary_Tree_Tilt_563 {
	
	int tilt=0;

	public int findTilt(TreeNode root) {
		if(root==null){
			return 0;
		}
		recursion(root);
		return tilt;	
	}
	
	public int recursion(TreeNode root){
		int left=0;
		int right=0;
		if(root.left!=null){
			left=root.left.val+recursion(root.left);
		}
		if(root.right!=null){
			right=root.right.val+recursion(root.right);
		}
		tilt+=Math.abs(left-right);
		return left+right;	
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Binary_Tree_Tilt_563 b=new Binary_Tree_Tilt_563();
		TreeNode root=new TreeNode(1);
		root.left=new TreeNode(2);
		root.right=new TreeNode(3);
		root.left.left=new TreeNode(4);
		root.right.left=new TreeNode(5);
		System.out.println(b.findTilt(root));
	}

}

大神的方法跟我类似

Java Solution, post-order traversal

public class Solution {
    int result = 0;
    
    public int findTilt(TreeNode root) {
        postOrder(root);
        return result;
    }
    
    private int postOrder(TreeNode root) {
        if (root == null) return 0;
        
        int left = postOrder(root.left);
        int right = postOrder(root.right);
        
        result += Math.abs(left - right);
        
        return left + right + root.val;
    }
}