Leetcode-标签为Tree 110. Balanced Binary Tree
来源:互联网 发布:网络摄像机排行榜 编辑:程序博客网 时间:2024/06/06 03:49
原题
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.
题目分析
判断二叉树是否为平衡二叉树。
代码实现
public class BanlancedTree { public bool IsBalanced(TreeNode root) { if (root == null) return true; if (Math.Abs(height(root.left) - height(root.right)) > 1) return false; return IsBalanced(root.left) && IsBalanced(root.right); } private int height(TreeNode node) { if (node == null) return 0; return 1 + Math.Max(height(node.left), height(node.right)); } }
1 0
- Leetcode-标签为Tree 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
- 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
- 企业QQ空间xss随意得客户端QQ号码 附(爆破盗号者后台)
- 【提高篇】经典算法——有序表的二分查找
- Java 初始化与清理
- Java反射三 构造方法
- Windows下编译qt-material
- Leetcode-标签为Tree 110. Balanced Binary Tree
- spring mvc 标签,@PathVariable,@cookieValue ,@RequestHeader等
- 面试13之检查链表是否为回文
- Ubuntu 添加删除开机启动项
- sbt版本定义
- 视图
- 20170423STL016_STL_关联容器
- 最小割
- 查看手机是UFS还是emmc