2018年2月13日
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 @ 2018-02-13 12:18 逸朵 阅读(133) 评论(0) 推荐(0) 编辑