diff --git a/Day22-Binary_Search_Trees.cpp b/Day22-Binary_Search_Trees.cpp
new file mode 100644
index 0000000..95d9f7a
--- /dev/null
+++ b/Day22-Binary_Search_Trees.cpp
@@ -0,0 +1,69 @@
+#include <iostream>
+#include <cstddef>
+
+using namespace std; 
+
+class Node{
+    public:
+        int data;
+        Node *left;
+        Node *right;
+        Node(int d){
+            data = d;
+            left = NULL;
+            right = NULL;
+        }
+};
+class Solution{
+    public:
+    Node* insert(Node* root, int data) {
+            if(root == NULL) {
+                return new Node(data);
+            }
+            else {
+                Node* cur;
+                if(data <= root->data){
+                    cur = insert(root->left, data);
+                    root->left = cur;
+                }
+                else{
+                    cur = insert(root->right, data);
+                    root->right = cur;
+               }
+
+               return root;
+           }
+        }
+         
+          int getHeight(Node* root){
+          //Write your code here
+          if(!root) {
+              return -1;
+          }
+          int leftDepth = getHeight(root->left);
+          int rightDepth = getHeight(root->right);
+              
+          return (leftDepth > rightDepth ? leftDepth : rightDepth) + 1;
+      }
+      
+      }; //End of Solution
+int main() {
+    Solution myTree;
+    Node* root = NULL;
+    int t;
+    int data;
+
+    cin >> t;
+
+    while(t-- > 0){
+        cin >> data;
+        root = myTree.insert(root, data);
+    }
+    int height = myTree.getHeight(root);
+    cout << height;
+
+    return 0;
+}
+
+
+By GiTan7