首页 > 代码库 > [leetcode-563-Binary Tree Tilt]
[leetcode-563-Binary Tree Tilt]
Given a binary tree, return the tilt of the whole tree.
The tilt of a tree node is defined as the absolute difference between
the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.
The tilt of the whole tree is defined as the sum of all nodes‘ tilt.
Example:
Input:
1
/ \
2 3
Output: 1
Explanation:
Tilt of node 2 : 0
Tilt of node 3 : 0
Tilt of node 1 : |2-3| = 1
Tilt of binary tree : 0 + 0 + 1 = 1
int sumOfTree(TreeNode* root) { if(root == NULL) return 0; if(root -> left == NULL && root -> right == NULL) return root->val; return sumOfTree(root->left) + sumOfTree(root->right) + root->val; } int getTilt(TreeNode* root) { if(root == NULL || (root->left == NULL)&&(root->right == NULL)) return 0; return abs(sumOfTree(root->left) - sumOfTree(root->right) ) ; } int findTilt(TreeNode* root) { if(root == NULL || (root->left == NULL)&&(root->right == NULL)) return 0; int left = findTilt(root->left); int right = findTilt(root->right); return left + right + getTilt(root); }
[leetcode-563-Binary Tree Tilt]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。