C++ (6 line) || Recursion || Inorder Traversal ||  230. Kth Smallest Element in a BST
Approach:\nSince inorder traversal of BST gives values in sorted order\nStore values in a vector using inorder traversal.  As 1 based indexing is there hence\n1
**Approach:**\nSince **inorder traversal** of BST **gives values in sorted order**\nStore values in a vector using *inorder* traversal.  As 1 based indexing is there hence\n**1st** **Smallest** **Value will be v[0] 2nd smallest will be v[1].............** *likewise* \n**kth smallest value will be v[k-1]** \n\n\tclass Solution {\n\t\tvector<int>v;\n\tpublic:\n\t\tvoid inorder(TreeNode* root)\n\t\t{\n\t\t\tif(root==NULL) return;\n\t\t\tinorder(root->left);\n\t\t\tv.push_back(root->val);\n\t\t\tinorder(root->right);\n\t\t}\n\t\tint kthSmallest(TreeNode* root, int k) {\n\t\t\tinorder(root);\n\t\t\t// v.resize(v.size());\n\t\t\treturn v[k-1];\n\t\t}\n\t};
['Binary Search Tree', 'Recursion', 'C']