#2476
Closest Nodes Queries in a Binary Search Tree
specialist · 975 · lc medium +32 · failed · 44.2% accepted · 535 likes · top 26%
Description
Given the root of a binary search tree and an array queries of positive integers, answer each query with a pair [mini, maxi] where mini is the largest BST value ≤ the query (or -1 if none exists) and maxi is the smallest BST value ≥ the query (or -1 if none exists). Return the 2D result array.
Example 1:
Input: root = [6,2,13,1,4,9,15,null,null,null,null,null,null,14], queries = [2,5,16]
Output: [[2,2],[4,6],[15,-1]]
Explanation: We answer the queries in the following way:
- The largest number that is smaller or equal than 2 in the tree is 2, and the smallest number that is greater or equal than 2 is still 2. So the answer for the first query is [2,2].
- The largest number that is smaller or equal than 5 in the tree is 4, and the smallest number that is greater or equal than 5 is 6. So the answer for the second query is [4,6].
- The largest number that is smaller or equal than 16 in the tree is 15, and the smallest number that is greater or equal than 16 does not exist. So the answer for the third query is [15,-1].
Example 2:
Input: root = [4,null,9], queries = [3]
Output: [[-1,4]]
Explanation: The largest number that is smaller or equal to 3 in the tree does not exist, and the smallest number that is greater or equal to 3 is 4. So the answer for the query is [-1,4].
Code
1
2
3
4
5
6
7
8
9