LeetCode - Kth Smallest Element in a BST - GoldmanSachs - Easy - C+++

 TreeNode* Smallest(TreeNode* kow, int &k){
        if(kow == NULL){
            return NULL;
        }
        TreeNode* a = Smallest(kow -> left, k);
        if(a != NULL){
            return a;
        }
        k--;
        if(k == 0){
            return kow;
        }
        return Smallest(kow -> right, k);
    }
    int kthSmallest(TreeNode* root, int k) {
        TreeNode* kee = Smallest(root, k);
        return kee -> val;
    }