563. Binary Tree Tilt (easy)

Q:

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.

A:

思路就是，利用参数的传引用， 来返回两个数字 

/**
 * 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) {
        int s = 0;
        return helper(root, s);
    }
private:
    int helper(TreeNode* root, int & ss)
    {
        if(!root)
        {
            ss = 0;
            return 0;
        }
        int lsum = 0, rsum =0;
        int l = helper(root->left, lsum);
        int r = helper(root->right, rsum);
        ss = root->val + lsum + rsum;
        return l + r + abs(lsum-rsum);
    }
};