C++ InOrder Solution (Simple)
```\n    void inOrder(TreeNode root)\n    {\n        if(!root)\n            return ;\n        inOrder(root->left);\n        tree.push_back(root->val);\n        
```\n    void inOrder(TreeNode* root)\n    {\n        if(!root)\n            return ;\n        inOrder(root->left);\n        tree.push_back(root->val);\n        inOrder(root->right);\n        \n    }\n    \n    int kthSmallest(TreeNode* root, int k) \n    {\n        inOrder(root);\n        return tree[k-1];\n    }\n    \nprivate:\n    std::vector<int> tree;
['C', 'C++']