记录每个节点为跟的树的节点个数,然后进行查找,若删除,添加只需要Oh的复杂度来更改节点个数
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
map<TreeNode*,int> cnt;
int init(TreeNode* root){
if(!root) return 0;
return (cnt[root]=1+init(root->left)+init(root->right));
}
int kthSmallest(TreeNode* root, int k) {
cnt[NULL]=0;
init(root);
if(k==cnt[root->left]+1) return root->val;
else if(k>cnt[root->left]+1) return kthSmallest(root->right,k-cnt[root->left]-1);
else return kthSmallest(root->left,k);
}
};