LeetCode@Tree_110_Balanced_Binary_Tree
来源:互联网 发布:python的日期格式化 编辑:程序博客网 时间:2024/06/05 06:14
110. Balanced Binary Tree
DescriptionHintsSubmissionsSolutions
- Total Accepted: 172600
- Total Submissions: 465133
- Difficulty: Easy
- Contributor: LeetCode
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.
Subscribe to see which companies asked this question.
Tree Depth-first Search
Hide Similar Problems
java:
/** * 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(root == null){return true;}else{return Math.abs(maxDepth(root.right) - maxDepth(root.left))<=1 && isBalanced(root.right)&& isBalanced(root.left);}}public int maxDepth(TreeNode root){int h = 0;if (root == null){return h;}else{return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));}}}
阅读全文
0 0
- LeetCode@Tree_110_Balanced_Binary_Tree
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- 自定义MVC
- 六、深搜广搜
- cuda安装与可能遇到的问题
- extern "C"
- 4.2.7--广搜--逃离迷宫
- LeetCode@Tree_110_Balanced_Binary_Tree
- 函数
- Spring源码分析之ProxyFactoryBean方式实现Aop功能的分析
- shell的外部命令和内部命令
- Cudnn安装与可能遇到的问题
- JavaWeb 17-6-18
- VS写C++无法切换完全模式
- js这么语言的能力取决于什么?js是否能够操作文件(一般不能),ajax能否操作文件(一般不能)?
- 安装 Y PPA Manager