leetcode 110.Balanced Binary Tree
来源：互联网 发布：好的诗句 知乎 编辑：程序博客网 时间：2024/06/06 20:01
题目:
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 ofevery node never differ by more than 1.
要求判断一棵二叉树是否是平衡二叉树，即每个节点的左右子树高度差不超过1。
思路：采用递归的方式，分别判断左右子树是否是平衡树，再计算左右两棵子树的高度差是否超过1。
代码AC:
0 0
- LeetCode 110. Balanced Binary Tree
- [LeetCode]110.Balanced Binary Tree
- 【LeetCode】110.Balanced Binary Tree
- [Leetcode] 110. Balanced Binary Tree
- LeetCode --- 110. Balanced Binary Tree
- [leetcode] 110.Balanced Binary Tree
- [leetcode]110. Balanced Binary Tree
- LeetCode:110. Balanced Binary Tree
- 110. Balanced Binary Tree LeetCode
- [LeetCode]110. Balanced Binary Tree
- Leetcode 110. Balanced Binary Tree
- LeetCode 110. Balanced Binary Tree
- LeetCode *** 110. Balanced Binary Tree
- leetcode 110. Balanced Binary Tree
- LeetCode 110. Balanced Binary Tree
- LeetCode 110. Balanced Binary Tree
- #leetcode#110. Balanced Binary Tree
- leetcode-110. Balanced Binary Tree
- 数据结构--简单实现计算器
- git remote详解
- IntelliJ IDEA15 简要使用手册
- minimum-depth-of-binary-tree
- 各种 Python 库/模块/工具
- leetcode 110.Balanced Binary Tree
- Apache POI以来jar包
- Sass环境搭建
- 二叉树中和为某一值的路径
- css3翻转效果
- Android源码分析--Handler机制的实现与工作原理
- Failed to establish session Error while Installing APKs
- 溶液模拟器
- 神经网络
