Balanced Binary Tree
来源:互联网 发布:英克医药软件 编辑:程序博客网 时间:2024/06/06 05:21
每日一题;
今天做的是判断二叉树是否平衡,自己有点没太弄明白概念,所以错了好多次,最后学习了一下别人怎么做的,才做了出来。
1、二叉树平衡是子树的最大深度减去最小深度不超过1;并不是从整棵树来看的,比如说{1,2,2,3,3,#,#,4,4}就是平衡的,但是{1,2,2,3,3,3,3,4,4,4,4,4,4,#,#,5,5}就不是平衡的,画出来才知道啊~
2、做减法的时候要加上绝对值;
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 ofevery node never differ by more than 1.
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public static boolean isBalanced(TreeNode root) { if(root == null){ return true; } if(Math.abs(deepth(root.left) - deepth(root.right))>1){ return false; } return isBalanced(root.left) && isBalanced(root.right); } public static int deepth(TreeNode root) { TreeNode treeNode = root; if(treeNode == null){ return 0; } return Math.max(deepth(root.left),deepth(root.right))+1; }}
0 0
- 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
- Balanced Binary Tree
- Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- Balanced Binary Tree
- Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- [Leetcode]Balanced Binary Tree
- [leetcode]Balanced Binary Tree
- mysql: group by 详细介绍
- HDU 2295 Radar(DLX可重复覆盖)
- [学习笔记]Java正则表达式
- cocos2d-x3.0开发游戏部分机型(显卡类型)闪退问题
- 输出1000到2000之间的闰年
- Balanced Binary Tree
- VC6.0 COM库制作
- 计算1-1/2+1/3-1/4+1/5 …… + 1/99 - 1/100的值
- iOS开发UINavigationController导航控制器初始化,导航控制器栈的push和pop跳转理解
- 黑马程序员-反射机制_动态代理
- jvm中动态编译器的原理
- c#arry排序
- JVM内存配置详解
- ADT双端队列的实现