Package g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2476 - Closest Nodes Queries in a Binary Search Tree.

    Medium

    You are given the root of a binary search tree and an array queries of size n consisting of positive integers.

    Find a 2D array answer of size n where <code>answeri = min<sub>i</sub>, max<sub>i</sub></code>:

    • <code>min<sub>i</sub></code> is the largest value in the tree that is smaller than or equal to queries[i]. If a such value does not exist, add -1 instead.

    • <code>max<sub>i</sub></code> is the smallest value in the tree that is greater than or equal to queries[i]. If a such value does not exist, add -1 instead.

    Return the array answer.

    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.

    Constraints:

    • The number of nodes in the tree is in the range <code>2, 10<sup>5</sup></code>.

    • <code>1 <= Node.val <= 10<sup>6</sup></code>

    • n == queries.length

    • <code>1 <= n <= 10<sup>5</sup></code>

    • <code>1 <= queriesi<= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<List<Integer>> closestNodes(TreeNode root, List<Integer> queries)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait