Leetcode Balanced Binary Tree
来源:互联网 发布:广联达软件最新版本 编辑:程序博客网 时间:2024/06/08 02:13
判断一个二叉树是否是高度平衡的。高度平衡的定义是:对每一个节点,其左儿子树与右儿子树的高度差小于等于1。8ms
int height(struct TreeNode* node) { if (!node) return 0; int l = height(node->left); if (l == -1) return -1; int r = height(node->right); if (r == -1 || abs(l - r) > 1) return -1; return l > r ? l+1 : r+1;} bool isBalanced(struct TreeNode* root) { return height(root) >= 0 ? true : false;}
0 0
- LeetCode: Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- LeetCode Balanced Binary Tree
- [Leetcode] Balanced Binary Tree
- LeetCode : Balanced Binary Tree
- LeetCode Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- [Leetcode]Balanced Binary Tree
- [leetcode]Balanced Binary Tree
- Leetcode: Balanced Binary Tree
- LeetCode-Balanced Binary Tree
- LeetCode - Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- LeetCode | Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- AndroidManifest.xml配置文件详解
- JAVA Web项目开发乱码问题备忘
- Android中源码Launcher主屏幕程序排列详解【安卓Launcher进化一】
- Latex 一些代码样式
- [150518]程序员颈椎保护指南
- Leetcode Balanced Binary Tree
- 欢迎使用CSDN-markdown编辑器
- NYOJ237 游戏高手的烦恼(最小点集覆盖)
- 常用的一些算法
- 仔细理解iOS成员变量和实例变量以及类方法和实例方法
- iOS中的round/ceil/floorf函数略解
- 【iOS开发-触摸】移动的UIView例子
- hdu 1069 Monkey and Banana
- 文字翻转动画效果