Skip to content

README.md

Latest commit

 

History

History
8 lines (6 loc) · 265 Bytes

README.md

File metadata and controls

8 lines (6 loc) · 265 Bytes

Problem

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.