[LeetCode]Balanced Binary Tree
来源:互联网 发布:淘宝好的精仿店 编辑:程序博客网 时间:2024/06/05 15:16
public boolean isBalanced(TreeNode root) { if(root==null)return true;// boolean result = false; if(Math.abs(depth(root.left)-depth(root.right))>1)return false; else return isBalanced(root.left)&&isBalanced(root.right);// result = Math.abs(depth(root.left)-depth(root.right))<=1?true:false;// return result; } public int depth(TreeNode root){ if(root==null)return 0; else return Math.max(depth(root.left),depth(root.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
- Log4j最佳实践
- C语言基础小知识
- 高德地图报错:BaseMapView initWithFrame exception
- Hive表数据导入到Hbase
- Python 中的进程、线程、协程、同步、异步、回调
- [LeetCode]Balanced Binary Tree
- HDU 4533 威威猫系列故事――晒被子 (线段树)
- (4.1.29) Android 操作SQLite基本用法
- 对一些简单排序算法的效率比较
- 数据库操作为什么会出现 sqlite3:not found?
- HDOJ 1159(POJ 1458)Common Subsequence (最长公共子序列 LCS)
- log4j日志输出性能优化-缓存、异步
- 常用正则表达式
- UIScrollerView约束注意点