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:
The sum of node values in any subtree won’t exceed the range of 32-bit integer.
All the tilt values won’t exceed the range of 32-bit integer.
计算一个二叉树的倾斜度 用一个递归求左右子树的和,再递归求倾斜度的和,感觉效率不高
public int findTilt(TreeNode root) {
if(root == null) return 0;
return Math.abs(sumNode(root.left) + sumNode(root.right))+findTilt(root.left)+findTilt(root.right);
}
public int sumNode(TreeNode root) {
if(root == null) return 0;
return root.val + sumNode(root.left) + sumNode(root.right);
}