CPMagical CP Library

Problem solution · C++

Closest Nodes Queries in a Binary Search Tree

Closest Nodes Queries in a Binary Search Tree: a C++ solution using binary search. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Binary search
Source
walkccc LeetCode Solutions
Length
33 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Binary search

For Closest Nodes Queries in a Binary Search Tree, the implementation exploits a monotonic condition to discard half of the remaining search space after every check.

  1. Identify the ordered answer range or sorted search domain.
  2. Write a predicate whose truth changes only once.
  3. Move the appropriate boundary after each midpoint check and return the final feasible position.

Code notes

  • 33 lines of C++ from the credited upstream file 2476.cpp.
  • The implementation visibly relies on sequence storage.
  • 1 loop block detected.

Complexity

Multiply the logarithmic number of midpoint checks by the cost of one predicate evaluation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeClosest Nodes Queries in a Binary Search Tree · C++C++
Use this to learn the idea, then write your own version.
class Solution { public:  vector<vector<int>> closestNodes(TreeNode* root, vector<int>& queries) {    vector<vector<int>> ans;    vector<int> sortedVals;     inorder(root, sortedVals);     for (const int query : queries) {      const auto it = ranges::lower_bound(sortedVals, query);      // query is presented in the tree, so just use {query, query}.      if (it != sortedVals.cend() && *it == query)        ans.push_back({query, query});      // query isn't presented in the tree, so find the cloest one if possible.      else        ans.push_back({it == sortedVals.cbegin() ? -1 : *prev(it),                       it == sortedVals.cend() ? -1 : *it});    }     return ans;  }  private:  // Walks the BST to collect the sorted numbers.  void inorder(TreeNode* root, vector<int>& sortedVals) {    if (root == nullptr)      return;    inorder(root->left, sortedVals);    sortedVals.push_back(root->val);    inorder(root->right, sortedVals);  }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗