2015年8月30日
[LeetCode] Closest Binary Search Tree Value II
摘要： Problem Description:Given a non-empty binary search tree and a target value, findkvalues in the BST that are closest to the target.Note:Given target v... 阅读全文
posted @ 2015-08-30 18:50 jianchao-li 阅读(4105) 评论(0) 推荐(0) 编辑