20 months ago

suryansh jaiswal • 370

Lucknow

Solution

int kthSmallest(TreeNode* root, int& k) {
    if (root) {
        int x = kthSmallest(root->left, k);
        return !k ? x : !--k ? root->val : kthSmallest(root->right, k);
    }
    return 0;
   }