LeetCode-563. Binary Tree Tilt (Java)

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

------------------------------------------------------------------------------------------------------------------------------------------------------------------

题意

求整个树的倾斜度，倾斜度可以理解为某节点的所有左子树值之和 与 右子树值之和的差值绝对值

思路

可以利用递归的方法，求每个节点的左子树和右子树之和。

代码

public class Solution {
     private int sum = 0;  
     public int findTilt(TreeNode root) {  
       helper(root);  
        return sum;  
    }  
  
    private int helper(TreeNode root) {  
        if (root == null)  
            return 0;  
        int left = helper(root.left);  
        int right = helper(root.right);  
        sum += Math.abs(left - right);  
        //每个节点的左右子树节点值之和
        return root.val + left + right;  
    }  
}