563. Binary Tree Tilt
来源:互联网 发布:linux ls查看文件大小 编辑:程序博客网 时间:2024/05/22 02:06
题目来源【Leetcode】
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 = 1Note:
The sum of node values in any subtree won’t exceed the range of 32-bit integer.
All the tilt values won’t exceed the range of 32-bit integer.
这道题是求每个节点的左右子树的总值之差,也比较简单,直接放代码:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ int f(TreeNode* root, int& sum){ if(root == NULL) return 0; int l = f(root->left,sum); int r = f(root->right,sum); sum += abs(l - r); return l + r + root->val; }class Solution {public: int findTilt(TreeNode* root) { if(root == NULL) return 0; int n = 0; f(root, n); return n; }};
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt **
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- 563. Binary Tree Tilt
- LeetCode 563. Binary Tree Tilt
- LeetCode | 563. Binary Tree Tilt
- [LeetCode]563. Binary Tree Tilt
- databinding的一个奇葩问题
- 已解决:序列nocache导致的log file sync等待事件
- java实现读者-写者问题
- 在centos7下编译安装memcached
- 关于面试题中结构体内存对齐计算总结
- 563. Binary Tree Tilt
- linux awk命令详解
- 《Unity 3D游戏客户端基础框架》概述
- B-tree与Mysql
- 玲珑杯round18(数论)
- 秒杀多线程第三篇 原子操作 Interlocked系列函数
- SQL练习
- VSCode使用技巧
- 找出链表的倒数第K个结点