Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target.
Note:
Follow up: Assume that the BST is balanced, could you solve it in less than O(n) runtime (where n = total nodes)?