LeetCode 563 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:

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.

题目大意：给出一个二叉树，求出它每个节点倾斜度之和。倾斜度定义：对于节点N来说，它的左子树所有元素之和与右子树所有元素之和的差的绝对值就是节点N的倾斜度。没有左子树和右子树的节点倾斜度为0.

解题思路：递归处理，先计算根节点的倾斜度，然后再分别计算左右子树的倾斜度。利用一个vector保存中间结果以减少重复计算。

代码如下：

/**
 * 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) {
        if(root == nullptr) return 0;
        int tilt = 0, res = 0;
        vector<int> ans;
        getSum(root, tilt, ans);
        for(auto it: ans)
            res += it;
        return res;
    }
private:
    void getSum(TreeNode* root, int& sum, vector<int>& ans) {
        if(root == nullptr) return ;
        int leftSum, rightSum;
        leftSum = rightSum = 0;
        getSum(root->left, leftSum, ans);
        getSum(root->right, rightSum, ans);
        sum += leftSum + rightSum + root->val;
        ans.push_back(abs(leftSum - rightSum));
    }
};