[LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值

 

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.

 

你可能感兴趣的:([LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值)