110. Balanced Binary Tree
来源:互联网 发布:毒性数据库 编辑:程序博客网 时间:2024/05/02 01:18
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.
可以算一下每个node的高度,算的同时可以比较是否满足两个子树高度相差不超过1的条件。
每个node,要求本身满足左右子树高度相差不超过1,左右子树也要递归满足条件才成立。
public boolean isBalanced(TreeNode root){return getdeep(root)[1]==1;}private int[] getdeep(TreeNode t){if(t==null)return new int[] {0,1};int[] larr=getdeep(t.left);int[] rarr=getdeep(t.right);int leftdeep=larr[0];int rightdeep=rarr[0];int max=Math.max(leftdeep, rightdeep);boolean heightdis=larr[1]==1&&rarr[1]==1&&((Math.abs(leftdeep-rightdeep))<=1);return new int[] {max+1,heightdis==true?1:0};}
0 0
- 110.Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- 110. Balanced Binary Tree
- zigbee协议栈应用(四)广播组网-无线数据传输
- 复制mp3、复制文件夹下所有文件的思路
- android ui 练习
- poj3281Dining
- C++复习1.const用法
- 110. Balanced Binary Tree
- 使用RAII来管理对象资源
- ajax笔记
- 《JavaScript学习笔记》:第一个面向对象的程序
- c++点滴
- pandas+matploblib画图 叠加两张图
- dubbo 入门,与zookeeper maven spring整合
- POJ1503
- 一个web项目web.xml的配置中<context-param>配置作用