270

270. Closest Binary Search Tree Value

Easy

48536FavoriteShare

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.

Example:

Input: root = [4,2,5,1,3], target = 3.714286 4 / \ 2 5 / \ 1 3 Output: 4

 

 

 

lambda  도 오랜만에 써보고 재미있는 문제이다.