Create main.cpp

Author: JawadSher

17 - Binary Tree Data Structure Problems/07 - Balanced Binary Tree/main.cpp

@@ -0,0 +1,32 @@
+/**
+ * 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 {
+private:
+    int height(TreeNode* root){
+        if(root == NULL) return 0;
+
+        int left = height(root -> left);
+        if(left == -1) return -1;
+
+        int right = height(root -> right);
+        if(right == -1) return -1;
+
+
+        if(abs(left - right) > 1) return -1;
+        
+        return max(left, right) + 1;
+    }
+public:
+    bool isBalanced(TreeNode* root) {
+        return height(root) != -1;
+    }
+};