class Solution {int res=0;int dfs(TreeNode* root) {if(!root) return 0;int left=dfs(root->left);int right=dfs(root->right);res+=abs(left-right);return root->val+left+right;}
public:int findTilt(TreeNode* root) {dfs(root);return res;}
};