Kth Smallest Element in a BST

题目：

 

Given a binary search tree, write a function kthSmallest to find thekth smallest element in it.

Note:
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.

Follow up:
What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?

分析：

        寻找第k个最小元素，注：二叉搜索树的右子树元素比左子树的元素大，使用递归的方法，根节点为kth元素的情况及时左子树的个数加上1即为k，此时根节点为第k小元素

代码：

/**
 * 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:

    int countnode(TreeNode* root)
    {
        if(root==NULL) return 0;
        return 1+countnode(root->left)+countnode(root->right);
        
    }

    int kthSmallest(TreeNode* root, int k) {
        int leftnode=0;
        leftnode=countnode(root->left);
       
        if((leftnode+1)==k) return root->val;
        if((leftnode+1)<k) return kthSmallest(root->right,k-leftnode-1);
        else
        return kthSmallest(root->left,k);
    }
};