【leetcode】Kth Smallest Element in a BST

Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth 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?
思路：
1）二叉搜索树的左子树比根节点和右子树的值小；
2）选择第k小的数据，其实就数子树的size

/**
 * 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 calsize(TreeNode* root)
    {
        if ( root == NULL ) return 0;
        return calsize(root -> left) + calsize(root -> right) + 1;
    }

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