[LeetCode] Balanced Binary Tree
来源：互联网 发布：json字符串解析 编辑：程序博客网 时间：2024/06/06 02:16
The difference of two sub-trees are no greater than 1.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: bool isBalanced(TreeNode *root) { return isBalancedHelper(root)!=-1; } int isBalancedHelper(TreeNode *root) { if(root==NULL) return 0; int left = isBalancedHelper(root->left); if(left==-1) return -1; int right = isBalancedHelper(root->right); if(right==-1 || abs(left-right)>1) return -1; return (left>right?left:right)+1; }}; 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
- Reverse Nodes in k-Group -- LeetCode
- LeetCode Matrix Summary
- Linux文件系统预读(二)
- Add Two Numbers -- LeetCode
- Reverse linked list
- [LeetCode] Balanced Binary Tree
- asp.net输出重写压缩页面文件人代码
- Highchart legend属性 实现翻页显示效果，解决legend过长
- asp.net 备份和恢复数据库
- stanford machine learning 笔记 1
- 3.EditText控件
- NYOJ NO.3 括号配对问题
- [LeetCode] Median of Two Sorted Arrays
- Java多线程同步机制（synchronized）
