[LeetCode]563. Binary Tree Tilt

[LeetCode]563. Binary Tree Tilt

题目描述

思路

深搜
因为是要计算左右子树节点和之间的绝对值，所以递归的返回值是子树节点的和（即需要拆两个函数）。
在递归的同时计算结果，注意因为是递归调用函数，因此需要临时变量来保存调用结果，不可以多次调用

代码

#include <iostream>

using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    int findTilt(TreeNode* root) {
        getSubTreeSum(root);
        return res;
    }
    int getSubTreeSum(TreeNode* root) {
        if (root == NULL)
            return 0;
        int leftSum = getSubTreeSum(root->left),
            rightSum = getSubTreeSum(root->right);
        res += abs(leftSum - rightSum);
        return leftSum + rightSum + root->val;
    }
private:
    int res = 0;
};

int main() {
    TreeNode *node1 = new TreeNode(1);
    TreeNode *node2 = new TreeNode(2);
    TreeNode *node3 = new TreeNode(3);
    TreeNode *node4 = new TreeNode(4);
    TreeNode *node5 = new TreeNode(5);

    node1->left = node2;
    node1->right = node3;
    node2->left = node4;
    node3->right = node5;

    Solution s;

    cout << s.findTilt(node1) << endl;

    system("pause");
    return 0;
}