2020年3月21日
[LeetCode] 272. Closest Binary Search Tree Value II
摘要： Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value is a floati 阅读全文
posted @ 2020-03-21 14:32 CNoodle 阅读(353) 评论(0) 推荐(0)
[LeetCode] 270. 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 floati 阅读全文
posted @ 2020-03-21 11:34 CNoodle 阅读(191) 评论(0) 推荐(0)