Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
Read this post on callicoder.com