题目
思路
先序遍历二叉搜索树得到一个升序的序列。
代码(非递归)
/**
* 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 kthSmallest(TreeNode* root, int k) {
int tot = 0;
stack<TreeNode*> s;
TreeNode * cur = root;
while(cur || !s.empty()){
while(cur){
s.push(cur);
cur = cur->left;
}
if(!s.empty()){
cur = s.top();
s.pop();
tot++;
if(tot == k) break;
cur = cur->right;
}
}
return cur->val;
}
};