LeetCode 272. Closest Binary Search Tree Value II(二叉搜索树查找)
原题网址:https://leetcode.com/problems/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:
原创
2016-04-13 06:15:51 ·
2045 阅读 ·
0 评论