563. Binary Tree Tilt - Easy

发布时间：2020-12-14 05:17:54 所属栏目：大数据来源：网络整理

导读：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 ti

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:

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.

把tilt作为global variable，每次recursion的时候更新

time: O(n),space: O(height)

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int tilt = 0;
    
    public int findTilt(TreeNode root) {
        traverse(root);
        return tilt;
    }
    
    public int traverse(TreeNode node) {
        if(node == null) {
            return 0;
        }
        int left = traverse(node.left);
        int right = traverse(node.right);
        tilt += Math.abs(left - right);
        
        return node.val + left + right;
    }
}

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!