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.

Analysis:

这个题可以用二叉树的性质，每次排除掉树的一半节点，然后判断是children的小还是当前节点小。

Leetcode中BFS的性质