1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27 | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void inOrderTraverse(TreeNode* node, std::vector<int>& v) {
if (node == nullptr)
return;
inOrderTraverse(node->left, v);
v.push_back(node->val);
inOrderTraverse(node->right, v);
}
int kthSmallest(TreeNode* root, int k) {
std::vector<int> v;
inOrderTraverse(root, v);
return v[k - 1];
}
};
|