272. Closest Binary Search Tree Value II

Problem

Find k values in a BST closest to the target.

Given the root of a Binary Search Tree (BST), a target value, and an integer k, return the k values in the BST that are closest to the target.

Examples
Input: [[4,2,5,1,3],3.714286,2]
Output: [4,3]
Hints
Related Problems

272. Closest Binary Search Tree Value II

Find k values in a BST closest to the target.