LeetCode110:Balanced Binary Tree
来源:互联网 发布:2017机顶盒直播软件 编辑:程序博客网 时间:2024/06/05 12:05
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int getDepth(TreeNode root, int curDepth){ ////如果为空 则返回当前的深度 if(root==null) return curDepth; //返回子树中最大的深度 return Math.max(getDepth(root.left,curDepth+1),getDepth(root.right,curDepth+1)); } public boolean isBalanced(TreeNode root) { //树为空 if(root==null) return true; //左子树的最大深度 int left = getDepth(root.left,1); //右子树的最大深度 int right = getDepth(root.right,1); //深度之差不能大于1 否则不平衡 if(Math.abs(left-right)>1){ return false; }else{ //左子树和右子树是否为平衡树 return isBalanced(root.left) && isBalanced(root.right); } }}
0 0
- LeetCode110 - Balanced Binary Tree
- LeetCode110-Balanced Binary Tree
- leetcode110---Balanced Binary Tree
- LeetCode110:Balanced Binary Tree
- LeetCode110. Balanced Binary Tree
- leetcode110~Balanced Binary Tree
- leetcode110. Balanced Binary Tree
- LeetCode110 Balanced Binary Tree
- leetcode110 Balanced Binary Tree
- Leetcode110. Balanced Binary Tree
- LeetCode110. Balanced Binary Tree
- LeetCode110—Balanced Binary Tree
- LeetCode110.Balanced Binary Tree题解
- LeetCode110——Balanced Binary Tree
- LeetCode110 Blanced Binary Tree Java 题解
- Balanced binary tree 扩展
- LeetCode: Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- const用法详解
- 第十六周项目1--验证算法--(5)直接选择排序
- [Noi2008]志愿者招募(BZOJ1061)
- Android微信登录(shareSDK)注意事项
- Eclipse下创建安卓项目时Create Activity—Blank Activity不能下一步,也不能点完成
- LeetCode110:Balanced Binary Tree
- Android 如何改变TextView中个别字样式
- Java集合框架 之Collection接口
- 简单的 利用 parser 获取页面信息
- POJ 3421 X-factor Chains 已被翻译
- spring的事务管理
- Pycharm安装思维导图(脑图)
- 统计字符串长度
- 数组中重复的数字