Browsed by
Author: J

Leetcode(270) – Closest Binary Search Tree Value

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 floating point. You are guaranteed to have only one unique value in the BST that is closest to the target.

上海自由行-Day 3

上海自由行-Day 3

看到凱特一個禮拜,迅速寫完上次的日本行,對照 J 的上海行,拖到現在也只寫到第 3 天,還真的有點小落後~趕緊來補進度!