【树】563. 二叉树的坡度

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     
13     int tilt=0;
14     int findTilt(TreeNode *root) 
15     {
16         traverse(root);
17         return tilt;
18     }
19     
20     int traverse(TreeNode *root)
21     {
22         if(root == NULL)
23         {
24             return 0;
25         }
26         int left=traverse(root->left);
27         int right=traverse(root->right);
28 
29         tilt+=std::abs(left-right);
30         
31         return left+right+root->val;
32     }
33 };