[LeetCode] 563. Binary Tree Tilt

原题链接：https://leetcode.com/problems/binary-tree-tilt/

1. 题目介绍

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.

给定一个二叉树，返回整棵树的倾斜度。

一个节点的倾斜度的定义：所有左子树节点值的总和与所有右子树节点值的总和之间的绝对差。 空节点，倾斜度为 0。

整棵树的倾斜度定义：所有节点倾斜度的总和。
Example:

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.
任何子树的所有节点的value值之和，不超过32位整数
全部节点的value值不超过32位整数。

2. 解题思路

深度优先搜索+递归即可解决。
具体实现可以看代码：
实现代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int Count = 0;
    public int findTilt(TreeNode root) {
        if(root == null){
            return 0;
        }
        helper(root);
        return Count;
    }
    //返回以root为根节点的树，所有节点的和
    public int helper(TreeNode root){
        if(root == null){
            return 0;
        }
        int a = helper(root.left);//左子树节点值之和
        int b = helper(root.right);//右子树节点之和
        Count += Math.abs(a - b);//root节点的倾斜度
        return a + b + root.val;
    }
}