原文:
https://leetcode.com/problems/binary-tree-tilt/discuss/102334/Java-Solution-post-order-traversal
原文的意思是求每个节点的Tilt,要理解这个题就得很好理解他,tilt就是该节点的所有左子节点的所有和与右子节点的和的绝对值,
原文的意思是求每个节点的Tilt,要理解这个题就得很好理解他,tilt就是该节点的所有左子节点的所有和与右子节点的和的绝对值,
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int res = 0;
public int findTilt(TreeNode root) {
helper(root);
return res;
}
public int helper(TreeNode root){
if(root == null) return 0;
int left = helper(root.left);
int right = helper(root.right);
res += Math.abs(left-right);
return left+right+root.val;
}
}