563. Binary Tree Tilt
Description
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.
Solution
- 题意即累和每个一个二叉树的每个节点的左右子树总和的差值(绝对值)。
- 我的做法是先用一个函数,递归将每个节点的值替换为以该节点为根的树的总和,然后使用另一个函数统计差值的总和。
- 其实这两个函数可以合并,在计算总和的时候便能够进行差值统计了,下面的代码是未合并的,如下,(有兴趣可以合并)。
class Solution {
public:
int rnt = 0;
int getSum(TreeNode *root) {
if (root->left) root->val += getSum(root->left);
if (root->right) root->val += getSum(root->right);
return root->val;
}
void travel(TreeNode *root) {
if (!root || (!root->left && !root->right)) return ;
travel(root->left);
travel(root->right);
if (!root->left)
rnt += abs(root->right->val);
else if (!root->right)
rnt += abs(root->left->val);
else
rnt += abs(root->left->val - root->right->val);
}
int findTilt(TreeNode* root) {
if (!root) return 0;
getSum(root);
travel(root);
return rnt;
}
};