Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target.
Example 1:
Input: root = [4,2,5,1,3], target = 3.714286 Output: 4
Example 2:
Input: root = [1], target = 4.428571 Output: 1
相关文章
- 12-30[leetcode]272. Closest Binary Search Tree Value II二叉搜索树中最近的值2
- 12-30[leetcode]270. Closest Binary Search Tree Value二叉搜索树中找target的最接近值
- 12-30270. Closest Binary Search Tree Value 二叉搜索树中，距离目标值最近的节点
- 12-30[LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值
- 12-30[LeetCode] Closest Binary Search Tree Value II 最近的二分搜索树的值之二