题目:给定一颗二叉搜索树,请找出其中的第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, unsigned int k)
{
if(pRoot == NULL)
return NULL;
TreeNode* ObjNode = NULL;
KthNode(pRoot, &ObjNode, k);
return ObjNode;
}
void KthNode(TreeNode* pRoot, TreeNode** ObjNode, unsigned int &k)
{
if(pRoot->left != NULL)
KthNode(pRoot->left, ObjNode, k);
if(*ObjNode == NULL)
{
if(k == 1)
{
*ObjNode = pRoot;
}
k--;
}
if(*ObjNode == NULL && pRoot->right != NULL)
KthNode(pRoot->right, ObjNode, k);
}
};