查找BST中Kth小的元素

Node* findKthSmallNode(Node *pNode, int &Kth)
{
    if (!pNode)
        return NULL;

    Node* pRetNode = NULL;
    pRetNode = findKthSmallNode(pNode->left, Kth);
    if (pRetNode != NULL)
        return pRetNode;

    Kth--;

    if (Kth == 0)
        return pNode;

    pRetNode = findKthSmallNode(pNode->left, Kth);
    if (pRetNode != NULL)
        return pRetNode;

    return NULL;    
}