题目:
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.
思路:
处理一个结点的时候,需要提前计算出它的左右子树的累积和,而这个累积和对父结点的处理也有用,所以我们将私有函数设计为:在参数中更新tilt,而返回值为累积和。当然也可以将tilt作为返回值,将子树的累积和作为参数。
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int findTilt(TreeNode* root) {
int tilt = 0;
getSumAndTilt(root, tilt);
return tilt;
}
private:
int getSumAndTilt(TreeNode *node, int &tilt) {
if (node == NULL) {
return 0;
}
int left_sum = getSumAndTilt(node->left, tilt);
int right_sum = getSumAndTilt(node->right, tilt);
tilt += abs(left_sum - right_sum);
return left_sum + right_sum + node->val;
}
};