/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode* root) {
if(root==nullptr) return true;
if(length(root->left) - length(root->right) <=1 && length(root->left) - length(root->right) >=-1)
{
return isBalanced(root->left) && isBalanced(root->right);
}
return false;
}
int length(TreeNode* root)
{
if(root == nullptr) return 0;
return 1 + max(length(root->left),length(root->right));
}
};
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode* root) {
return length(root) != -1;
}
int length(TreeNode* root)
{
if(root == nullptr) return 0;
int left = length(root->left);
if(left == -1) return -1;
int right = length(root->right);
if(right == -1) return -1;
return abs(right-left) < 2?max(left,right)+1:-1;
}
};
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root) {
if(root == nullptr) return 0;
if(root->left == nullptr && root->right == nullptr) return 1;
if(root->left == nullptr) return minDepth(root->right)+1;
if(root->right == nullptr) return minDepth(root->left)+1;
return min(minDepth(root->left),minDepth(root->right))+1;
}
};