1. 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.

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.

2. Runtime Distribution

3. Submission Details

4. Example

Example 1:

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

5. Code

[restabs alignment="osc-tabs-right" responsive="true" icon="true" text="More" seltabcolor="#fdfdfd" seltabheadcolor="#000" tabheadcolor="blue"]
[restab title="Java" active="active"]

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

	int[] result = new int[1];
	handleSub(root, result);
	return result[0];
}

private int handleSub(TreeNode root, int[] result) {
	if (root == null) {
		return 0;
	}

	int l = handleSub(root.left, result);
	int r = handleSub(root.right, result);

	result[0] += Math.abs(l - r);

	return l + r + root.val;
}

[/restab]
[/restabs]

6.Test

[restabs alignment="osc-tabs-right" responsive="true" icon="true" text="More" seltabcolor="#fdfdfd" seltabheadcolor="#000" tabheadcolor="blue"]
[restab title="Java" active="active" ]

public class LeetCode0563 {
	static class TreeNode {
		int val;
		TreeNode left;
		TreeNode right;

		TreeNode(int x) {
			val = x;
		}
	}

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

		int[] result = new int[1];
		handleSub(root, result);
		return result[0];
	}

	private int handleSub(TreeNode root, int[] result) {
		if (root == null) {
			return 0;
		}

		int l = handleSub(root.left, result);
		int r = handleSub(root.right, result);

		result[0] += Math.abs(l - r);

		return l + r + root.val;
	}
}

[/restab]
[/restabs]