give root binary tree return sum tree node tiltthe tilt tree node absolute difference sum leave subtree node value right subtree node value if node leave child sum leave subtree node value treat 0 the rule similar node right child Example 1input root 123output 1explanation Tilt node 2 00 0 childrenTilt node 3 00 0 childrenTilt node 1 23 1 leave subtree leave child sum 2 right subtree right child sum 3sum tilt 0 0 1 1example 2input root 42935null7output 15explanation Tilt node 3 00 0 childrenTilt node 5 00 0 childrenTilt node 7 00 0 childrenTilt node 2 35 2 leave subtree leave child sum 3 right subtree right child sum 5Tilt node 9 07 7 leave child sum 0 right subtree right child sum 7Tilt node 4 35297 1016 6 leave subtree value 3 5 2 sum 10 right subtree value 9 7 sum 16sum tilt 0 0 0 2 7 6 15example 3input root 21714112233output 9 ConstraintsThe number nod tree range 0 1041000 Nodeval 1000