FilesExpand file tree

 master

/

Binary_Tree_Tilt.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

25 lines (24 loc) · 632 Bytes

 master

/

Binary_Tree_Tilt.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

25 lines (24 loc) · 632 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode(int x) : val(x), left(NULL), right(NULL) {}

* };

*/

class Solution {

int findTilt(TreeNode* root, int& result) {

if(!root) return 0;

int leftSum = findTilt(root->left, result);

int rightSum = findTilt(root->right, result);

result += abs(leftSum - rightSum);

return (leftSum + root->val + rightSum);

}

public:

int findTilt(TreeNode* root) {

int result = 0;

findTilt(root, result);

return result;

}

};