Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
Note:
Given target value is a floating point.
You are guaranteed to have only one unique value in the BST that is closest to the target.empty binary search tree and a
阅读背景：
Leetcode: Closest Binary Search Tree Value
来源：互联网
分享到：
