Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
Note:
[LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值
原文：http://www.cnblogs.com/grandyang/p/5237170.html
