cpp files

inorderTraversel.cpp

@@ -0,0 +1,34 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+ TreeNode * buildTreeRec(int s,int e,vector<int> inorderTraversel ){
+     if(s>e){
+         return NULL;
+     }
+
+     int ind = -1;
+     int max = INT_MIN;
+     for(int i=s;i<=e;i++){
+         if(inorderTraversel[i]>max){
+             max = inorderTraversel[i];
+             ind = i;
+         }
+     }
+     TreeNode *curr = new TreeNode(inorderTraversel[ind]);
+
+     curr->left = buildTreeRec(s,ind-1,inorderTraversel);
+     curr->right = buildTreeRec(ind+1,e,inorderTraversel);
+     return curr;
+
+ }
+TreeNode* Solution::buildTree(vector<int> &A) {
+    return buildTreeRec(0,A.size()-1,A);
+
+}

sortedArrayToBST.cpp

@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std;
+  struct TreeNode {
+      int val;
+      TreeNode *left;
+      TreeNode *right;
+     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+  };
+
+
+TreeNode *bstFromSortedVector(const vector<int> &A,int s, int e){
+    if(s>e){
+        return (NULL);
+    }
+
+    int mid = (s+e)/2;
+    TreeNode *root = new TreeNode(A[mid]);
+    root->left = bstFromSortedVector(A,s,mid-1);
+    root->right = bstFromSortedVector(A,mid+1,e);
+
+    return (root);
+
+
+
+}
+TreeNode *sortedArrayToBST(const vector<int> &A) {
+
+    TreeNode *root =  bstFromSortedVector(A,0,A.size()-1);
+    return (root);
+
+}