diff --git a/Optimized_Is_Balanced_BinaryTree.cpp b/Optimized_Is_Balanced_BinaryTree.cpp
new file mode 100644
index 0000000..9c1157a
--- /dev/null
+++ b/Optimized_Is_Balanced_BinaryTree.cpp
@@ -0,0 +1,75 @@
+#include <iostream>
+#include <queue>
+using namespace std;
+
+class node
+{
+public:
+    int data;
+    node *left;
+    node *right;
+
+    node(int d)
+    {
+        data = d;
+        left = NULL;
+        right = NULL;
+    }
+};
+
+node *build(string s)
+{
+    if (s == "true")
+    {
+        int d;
+        cin >> d;
+        node *root = new node(d);
+        string l;
+        cin >> l;
+        if (l == "true")
+        {
+            root->left = build(l);
+        }
+        string r;
+        cin >> r;
+        if (r == "true")
+        {
+            root->right = build(r);
+        }
+        return root;
+    }
+    return NULL;
+}
+
+
+// optimized version for checking whether the binary tree is Balanced or not
+pair<int,bool> isHeightBalancedOptimised(node *root)
+{
+    pair<int,bool> p;
+    if(root==NULL){
+        p.first=0;
+        p.second=true;
+        return p;
+    }
+     
+     pair<int ,bool> l=isHeightBalancedOptimised(root->left);
+     pair<int,bool> r=isHeightBalancedOptimised(root->right);
+     p.first=max(l.first,r.first)+1;
+
+     if(l.second==true && r.second==true && abs(l.first-r.first)<=1){
+         p.second=true;
+     }
+     else
+     p.second=false;
+
+     return p;
+}
+
+int main()
+{
+    node *root = build("true");
+
+    cout << boolalpha << isHeightBalancedOptimised(root).second;
+
+    return 0;
+}