LeetCode-Balanced Binary Tree
2014-09-07 19:41
309 查看
题目:https://oj.leetcode.com/problems/balanced-binary-tree/
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.
源码:Java版本
算法分析:使用栈。时间复杂度O(n),空间复杂度O(logn)
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.
源码:Java版本
算法分析:使用栈。时间复杂度O(n),空间复杂度O(logn)
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public boolean isBalanced(TreeNode root) { return balancedHeight(root)>=0?true:false; } private int balancedHeight(TreeNode root) { if(root==null) { return 0; } int left=balancedHeight(root.left); int right=balancedHeight(root.right); if(left<0 || right <0 || Math.abs(left-right)>1) { return -1; } return Math.max(left,right)+1; } }
相关文章推荐
- [Leetcode] Balanced Binary Tree
- leetcode -- Balanced Binary Tree TODO
- [LeetCode] Balanced Binary Tree
- Balanced Binary Tree——LeetCode
- leetcode_110 Balanced Binary Tree
- leetcode Balanced Binary Tree
- Balanced Binary Tree-LeetCode
- leetcode Balanced Binary Tree
- Leetcode Balanced Binary Tree
- [Leetcode] Balanced Binary Tree (Java)
- LeetCode学习篇二十五——Balanced Binary Tree
- [leetcode]110. Balanced Binary Tree
- [Leetcode]110. Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- [C]LeetCode:Balanced Binary Tree
- [leetcode]Balanced Binary Tree @ Python
- LeetCode 110 Balanced Binary Tree(平衡二叉树)(*)
- 开始刷题leetcode day3:Balanced Binary Tree
- leetcode: Balanced Binary Tree
- 【LeetCode笔记】Balanced Binary Tree 高度平衡二叉树