Runtime: 36 ms (Top 27.23%) | Memory: 24.3 MB (Top 34.42%)

Author: AnasImloul

scripts/algorithms/K/Kth Smallest Element in a BST/Kth Smallest Element in a BST.cpp

@@ -1,9 +1,10 @@
+// Runtime: 36 ms (Top 27.23%) | Memory: 24.3 MB (Top 34.42%)
 class Solution {
 public:
     void findInorder(TreeNode* root, vector<int> &ans) {
         if(root == NULL)
             return;
-        
+
         findInorder(root->left, ans);
         ans.push_back(root->val);
         findInorder(root->right, ans);
@@ -13,4 +14,4 @@ class Solution {
         findInorder(root, ans);
         return ans[k-1];
     }
-};
+};