-
Notifications
You must be signed in to change notification settings - Fork 0
/
139 Find-kth-smallest-element-in-BST.cpp
57 lines (51 loc) · 1.53 KB
/
139 Find-kth-smallest-element-in-BST.cpp
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/**
* 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 findInorder(TreeNode* root, vector<int> &inorder) {
if(root==NULL)
return;
findInorder(root->left,inorder);
inorder.push_back(root->val);
findInorder(root->right,inorder);
}
int kthSmallest(TreeNode* root, int k) {
vector<int> inorder;
findInorder(root,inorder);
return inorder[k-1];
}
};/**
* 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 findInorder(TreeNode* root, vector<int> &inorder) {
if(root==NULL)
return;
findInorder(root->left,inorder);
inorder.push_back(root->val);
findInorder(root->right,inorder);
}
int kthSmallest(TreeNode* root, int k) {
vector<int> inorder;
findInorder(root,inorder);
return inorder[k-1];
}
};