Merge pull request #53 from rsarthak/Sarthak

added Binary trees Problem

Author: gantavyamalviya

Trees/BalancedBinarytrees.cpp

@@ -0,0 +1,27 @@
+/**
+ * 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) {}
+ * };
+ */
+//LeetCode solution of Balanced Binary Trees Problem
+class Solution {
+public:
+    int check(TreeNode* root){
+        if(root==NULL)return 0;
+        int lh=check(root->left);
+        int rh=check(root->right);
+        if(lh==-1 || rh==-1)return -1;
+        if(abs(lh-rh)>1)return -1;
+        return max(lh,rh)+1;
+    }
+    
+    bool isBalanced(TreeNode* root) {
+        return check(root)!=-1;
+    }
+};