leetcode--Balanced Binary Tree
来源:互联网 发布:手机里网络错误怎么办 编辑:程序博客网 时间:2024/06/08 10:50
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,则递归判断左右子树是否平衡。
如果不符合平衡二叉树条件,则返回假。
原文链接http://blog.csdn.net/crazy__chen/article/details/46378853
阅读全文
0 0
- 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
- [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
- LeetCode | Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- Java中数组的使用
- CNN的训练图像与测试图像不一致的多尺度问题
- 名字隐藏与重载
- WebRTC学习之ICE深入理解
- 使用python获取email的subject中带有指定字符串的邮件
- leetcode--Balanced Binary Tree
- 深入理解jquery新的绑定事件机制on方法的使用(推荐)
- React常见问题集锦
- xp系统Arduino编译时,出现collect2.exe: error: ld returned 5 exit status的解决方案
- impala的原理架构介绍及应用场景
- log4j配置文件详解
- 剑指Offer:二叉搜索树的第K个结点
- vscode: Visual Studio Code 常用快捷键
- 进行批量操作-审核或弃审