230

Author: Ashish-kumar7

145.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    vector<int> postorderTraversal(TreeNode* root) {
+        vector<int>A;
+        traversingtree(root,A);
+        return A;
+    }
+    
+    void traversingtree(TreeNode * root,vector<int>&A){   
+        if(root==NULL){
+            return ;
+        }
+        
+        traversingtree(root->left,A);
+       
+        traversingtree(root->right,A);
+        
+         A.push_back(root->val);
+    }
+};

230.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int kthSmallest(TreeNode* root, int k) {
+          vector<int>A;
+        traversingtree(root,A);
+        return A[k-1];
+    }
+    
+    void traversingtree(TreeNode * root,vector<int>&A){   
+        if(root==NULL){
+            return ;
+        }
+        
+        traversingtree(root->left,A);
+       A.push_back(root->val);
+        traversingtree(root->right,A);
+        
+         
+    }
+    
+
+};