110. Balanced Binary Tree
来源:互联网 发布:淘宝客服电话人工按几? 编辑:程序博客网 时间:2024/05/21 04:00
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.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public boolean isBalanced(TreeNode root) { if(getHeight(root) == -1) return false; return true; } private int getHeight(TreeNode root){ if(root == null) return 0; int leftHeight = getHeight(root.left); int rightHeight = getHeight(root.right); if(leftHeight == -1 || rightHeight == -1) return -1; int diff = Math.abs(leftHeight - rightHeight); if(diff > 1) return -1; return Math.max(leftHeight, rightHeight) + 1; }}
阅读全文
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
- Android 优雅的为RecyclerView添加HeaderView和FooterView
- springMVC+hibernate+spring干净的一个配置文件
- LintCode 二叉树的前序,中序,后序,层次遍历
- 有损服务
- Gym
- 110. Balanced Binary Tree
- 百练_2723:不吉利日期
- Java学习笔记:初识Java
- 百练_2729:求12以内n的阶乘
- Codeforces 520E/521C Pluses everywhere
- 表驱动法简易教程
- note 1
- struts2 中redirectAction如何传递参数!(转)
- hdu4763 Theme Section(kmp)