110. Balanced Binary Tree (平衡二叉树判断)
来源:互联网 发布:webpack搭建php服务器 编辑:程序博客网 时间:2024/05/16 17:44
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.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int depth(TreeNode root){ if(root==null) return 0; return Math.max(depth(root.left),depth(root.right))+1; } 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); }}
0 0
- 110. Balanced Binary Tree (平衡二叉树判断)
- 110. Balanced Binary Tree | 判断是否是平衡二叉树
- Balanced Binary Tree --判断平衡二叉树(重重)
- LeetCode:Balanced Binary Tree(平衡二叉树的判断)
- Balanced Binary Tree(平衡二叉树)
- leetcode 110. Balanced Binary Tree(平衡二叉树的判断) DFS深度优先遍历
- LeetCode 110. Balanced Binary Tree(平衡二叉树)
- 110. Balanced Binary Tree 平衡二叉树(重点!!)
- Balanced Binary Tree 判断是否平衡二叉树 @LeetCode
- Balanced Binary Tree 平衡二叉树的判断
- Balanced Binary Tree 判断是否为平衡二叉树
- Balanced Binary Tree:判断一棵树是否为平衡二叉树
- 剑指offer 面试题39:判断平衡二叉树(LeetCode 110. Balanced Binary Tree) 题解
- LeetCode OJ 之 Balanced Binary Tree (平衡二叉树的判断)
- Balanced Binary Tree 二叉平衡树
- 【LeetCode】Balanced Binary Tree,平衡二叉树
- [LeetCode] Balanced Binary Tree 平衡二叉树
- Leetcode Balanced Binary Tree 平衡二叉树
- 107. Binary Tree Level Order Traversal II (二叉树由底向上层次遍历)
- Day53、表连接、合并结果集、组函数和分组、子查询、表操作(创建、删除、更新)、事务控制语句
- OSG开源教程
- 欢迎使用CSDN-markdown编辑器
- C++与设计模式(2)--策略模式
- 110. Balanced Binary Tree (平衡二叉树判断)
- [struts2]严重: Dispatcher initialization failed java.lang.RuntimeException: java.lang.reflect.Invocati
- 浮雕效果一键工具
- CSS学习笔记:层叠和继承
- 重新学习C语言——比较两个数大小
- 8086指令
- ps快捷键总结
- 单链表实现多项式相加
- 圆,y=x²