563. Binary Tree Tilt*
https://leetcode.com/problems/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:
- 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.
C++ 实现 1
其实和 543. Diameter of Binary Tree* 以及 530. Minimum Absolute Difference in BST* 这类题的思路一致, 递归的结果可能会在中途用到, 我们需要定义一个全局的变量来保存最终返回的结果.
/**
* 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 {
private:
int sum = 0;
int traverse(TreeNode *root) {
if (!root) return 0;
auto l = traverse(root->left);
auto r = traverse(root->right);
sum += std::abs(l - r);
return root->val + l + r;
}
public:
int findTilt(TreeNode* root) {
traverse(root);
return sum;
}
};