int main(int argc, char **argv) { struct TreeNode n1 = {1, NULL, NULL}, n2 = {2, NULL, NULL}, n3 = {3, NULL, NULL}; int res; n1.left = &n2; n1.right = &n3; res = findTilt(&n1); return 0; }
int findTilt(TreeNode* root) { if (!root) return 0; else return findTilt(root->left) + findTilt(root->right) + abs(findSum(root->left) - findSum(root->right)); }