leetcode110 Balanced Binary Tree
来源:互联网 发布:软件开发基础教程pdf 编辑:程序博客网 时间:2024/06/08 08:10
题目
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.
一棵平衡二叉树即一棵二叉树的所有节点的左右子树的高度差不超过1.
解题思路
很显然,解这道题需要从得到二叉树的高度的算法修改而来。
获取二叉树的高度的算法:
private int height(TreeNode node) { if (node == null) { return 0; } else { int i = height(node.left); int j = height(node.right); return (i < j) ? j + 1 : i + 1; } }
只需要修改下,让树的左右子树的高度差大于1时,返回-1.
public class leetcode110 { public boolean isBalanced(TreeNode root) { int res = helper(root); return res != -1; } private int helper(TreeNode node) { if (node == null) { return 0; } else { int i = helper(node.left); int j = helper(node.right); if (i == -1 || j == -1) return -1; else { if (Math.abs(i - j) > 1) return -1; else return Math.max(i, j) + 1; } } }}
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
- 1703->>今年暑假不AC
- Git分布式版本管理工具--安装,配置
- c++作业5
- 编辑工具Sublime常用插件及快捷键设置
- 给指定的String类型时间添加指定时长
- leetcode110 Balanced Binary Tree
- 麦子学院IT资源
- 应用调试之使用strace命令跟踪系统调用
- HDU 1007-Quoit Design
- 解决内部ViewPager不能向左滑动的bug
- IO流类之间关系图
- 轮播图源码分析
- axios-mock-adapter
- FFMPEG Tips (2) 如何提取码流的基本信息