Largest BST Subtree - Question | Binary Trees | Data Structure and Algorithms in JAVA

#pepcoding #java #programming

[wecan]

code in c++
class Solution{
public:
//Function to check whether a binary tree is balanced or not.
bool isBalanced(Node *root)
{
int ans=CheckHeight(root);
if(ans<=1){
return false;
}
else{
return true;
}
}

static int CheckHeight(Node* root){
if(root==NULL){
return 0;
}
int
if(LeftHeight==-1){
return -1;
}
int
if(RightHeight==-1){
return -1;
}

return -1;
}
else{
return max(LeftHeight, RightHeight)+1;
}
}
};