[Leetcode]Balanced Binary Tree
来源:互联网 发布:四班三倒排班表软件 编辑:程序博客网 时间:2024/05/17 18:24
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
判断树是否平衡~要维护树的深度,并且比较左右子树的深度差~代码如下~
class Solution: # @param root, a tree node # @return a boolean def isBalanced(self, root): return self.helper(root) >= 0 def helper(self, root): if root is None: return 0 left = self.helper(root.left) right = self.helper(root.right) if left < 0 or right < 0 or abs(left - right) > 1: return -1 return max(left, right) + 1
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
- 【BST】把两棵BST合并成一棵高度平衡的BST
- c++指针与函数参数传递---小结
- Mysql和SqlServer互相转换-数据源ODBC方法
- html5
- unity之NPC人物名称显示
- [Leetcode]Balanced Binary Tree
- OpenCV基础04(直方图与匹配)
- wireshark视频笔记
- 殊途同归
- kinect+openni获取kinect的颜色图像和深度图像
- Cts框架解析(21)-测试结果收集系统
- 简单的索引合并压缩算法研究
- 什么时候用存储过程
- delphi执行cmd命令和bat文件