leetcode/BinaryTreeTilt.cpp at master · ankurmoh/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int sumSubTree(TreeNode* root)
    {
        if (root == NULL)
            return 0;
        return root->val + sumSubTree(root->left) + sumSubTree(root->right);
    }
    int findTilt(TreeNode* root)
    {
        if (root == NULL)
            return 0;
        int curVal = 0;
        curVal = abs(sumSubTree(root->left) - sumSubTree(root->right));
        return curVal + findTilt(root->left) + findTilt(root->right);
    }
};