题目描述
思路分析
二叉树+dfs
考察性质:BST的中序遍历是递增的
代码实现
/**
* 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:
int res,k;
int kthSmallest(TreeNode* root, int _k) {
k=_k;
dfs(root);
return res;
}
void dfs(TreeNode* u){
if(!u->left&&!u->right){
k--;
if(!k) res=u->val;
return;
}
if(u->left) dfs(u->left);
k--;
if(!k) res=u->val;
if(u->right) dfs(u->right);
}
};