sireesh-001
diff --git a/‎February Leetcode Challenge 2021/02 trimBST.cpp
Copy file name to clipboard
+28Lines changed: 28 additions & 0 deletions b/‎February Leetcode Challenge 2021/02 trimBST.cpp
Copy file name to clipboard
+28Lines changed: 28 additions & 0 deletions
@@ -0,0 +1,28 @@
+/**
+ * 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 {
+public:
+    TreeNode* trimBST(TreeNode* root, int low, int high) {
+        
+        if (root == NULL)
+            return root;
+        else if (root->val > high)
+            return trimBST(root->left, low, high);
+        else if (root->val < low)
+            return trimBST(root->right, low, high);
+        else {
+            root->left = trimBST(root->left, low, high);
+            root->right = trimBST(root->right, low, high);
+            return root;
+        }        
+    }
+};