题目描述
给定一颗二叉搜索树,请找出其中的第k小的结点。例如, 5 / \ 3 7 /\ /\ 2 4 6 8 中,按结点数值大小顺序第三个结点的值为4。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
TreeNode* KthNode(TreeNode* pRoot, int k)
{
vector<TreeNode*> vec_p;
bianli(pRoot,k,vec_p);
if(vec_p.size()<k || k<1) return NULL;
return vec_p[k-1];
}
private:
void bianli(TreeNode* pRoot,int k,vector<TreeNode*>& vec_p)
{
if(pRoot==NULL || vec_p.size()>k) return ;
bianli(pRoot->left,k,vec_p);
vec_p.push_back(pRoot);
bianli(pRoot->right,k,vec_p);
}
};