MayUWell

Learn, Sleep, Learn

563-Binary Tree Tilt

Description

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.

class Solution {
private int tilt = 0;

public int findTilt(TreeNode root) {
getSum(root);

return tilt;
}

public int getSum(TreeNode root){
if(root == null) return 0;

int left = getSum(root.left);
int right = getSum(root.right);
tilt += Math.abs(left - right);

return left + right + root.val;
}
}

563. Binary Tree Tilt

2017-04-23 18:04:02

[leetcode: Python]563. Binary Tree Tilt

2017-05-19 16:26:12

[LeetCode]563. Binary Tree Tilt(二叉树的差值)

2017-04-25 20:25:17

LeetCode之路：563. Binary Tree Tilt

2017-05-12 12:34:09

[leetcode]563. Binary Tree Tilt

2017-05-05 22:48:47

LeetCode-563. Binary Tree Tilt (Java)

2017-06-22 09:59:36

LeetCode Binary Tree Tilt

2017-08-22 23:04:47

[LeetCode]563. Binary Tree Tilt解法及python代码

2018-02-02 14:38:59

firefox扩展Tilt-让浏览的网页带有3D效果

2017-07-25 09:34:43

通过火狐浏览器Tilt查看3维DOM

2017-03-02 09:41:09