-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBalancedBinaryTree.cpp
More file actions
38 lines (32 loc) · 997 Bytes
/
BalancedBinaryTree.cpp
File metadata and controls
38 lines (32 loc) · 997 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/**
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 binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int getHeight(TreeNode* root) {
if (!root) return 0;
return std::max(1+ getHeight(root->left), 1+ getHeight(root->right));
}
bool isBalancedUtil(TreeNode* root) {
if (!root) return true;
int left = getHeight(root->left);
int right = getHeight(root->right);
if (abs(left-right) <=1 && isBalancedUtil(root->left) && isBalancedUtil(root->right))
return true;
return false;
}
bool isBalanced(TreeNode *root) {
return isBalancedUtil(root);
}
};