[LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值
Posted Grandyang
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[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 最近的二分搜索树的值的主要内容，如果未能解决你的问题，请参考以下文章
Leetcode 270: Closest Binary Search Tree Value
[leetcode]Closest Binary Search Tree Value
[LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值
Leetcode 743. Closest Leaf in a Binary Tree