LeetCode题解:Balanced Binary Tree
来源:互联网 发布:手绘头像软件 编辑:程序博客网 时间:2024/05/17 16:14
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
解决思路:……
代码:
public class Solution { public boolean isBalanced(TreeNode root) { if(root == null){ return true; } if(Math.abs(depth(root.left) - depth(root.right)) > 1){ return false; } return isBalanced(root.left) && isBalanced(root.right); } private int depth(TreeNode root){ if(root == null){ return 0; } return Math.max(depth(root.left), depth(root.right)) + 1; }}
0 0
- LeetCode题解:Balanced Binary Tree
- LeetCode题解: Balanced Binary Tree
- leetcode Balanced Binary Tree 题解
- LeetCode题解:Balanced Binary Tree
- [LeetCode] Balanced Binary Tree 题解
- LeetCode 题解(20): Balanced Binary Tree
- LeetCode题解——Balanced Binary Tree
- LeetCode题解-110-Balanced Binary Tree
- LeetCode 110. Balanced Binary Tree 题解
- LeetCode 110. 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
- 【leetcode】Balanced Binary Tree
- hello word
- python进制转换(读取纯二进制文件内容)
- IP协议头格式分析
- [leetcode] 228.Summary Ranges
- iOS应用程序生命周期
- LeetCode题解:Balanced Binary Tree
- 8-26
- BZOJ 2302 HAOI2011 Problem c 动态规划
- zoj2156 Charlie's Change 完全背包+路径记录
- printf函数参数压栈顺序
- String 、 StringBuffer
- IplImage的相关知识
- 关于最大费用最大流的一类问题 【小谈】
- JVM之ClassLoader