LeetCode-10/Tree/272.Closest-Binary-Search-Tree-Value-II at master · DataStudySquad/LeetCode-10

Name		Name	Last commit message	Last commit date
parent directory ..
272.Closest Binary Search Tree Value II.cpp		272.Closest Binary Search Tree Value II.cpp
Readme.md		Readme.md

Readme.md

构造一个队列。按中序遍历递归这个数组，不断将访问的节点加入这个队列。当加入的元素与target的差距大于队首元素与target的差距，即可停止。