Given the root of a binary search tree and a floating point target value, find the node value in the BST that is closest to target. If there are multiple node values with the same minimum distance to target, return the smallest among them.

Note: The target is a floating point number, while all node values are integers.

Constraints:

• The number of nodes in the tree is in the range $[1, 10^4]$.

• $0 \leq$ Node.val $\le 10^{}$ ...