题目描述:
主要思路:
利用搜索二叉树的中序遍历是单调的这一性质。
/**
* 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 ans=0;
int kk=0;
void dfs(TreeNode* root,int k)
{
if(!root||ans)
return;
dfs(root->left,k);
cout<<root->val<<' '<<kk<<endl;
kk+=1;
if(kk==k)
ans=root->val;
dfs(root->right,k);
}
int kthSmallest(TreeNode* root, int k) {
dfs(root,k);
return ans;
}
};