Available question text
For each query value, return the floor (largest value ≤ query) and ceil (smallest value ≥ query) that exist in the given binary search tree, using -1 when no such value exists. With up to 1e5 nodes/queries, solve efficiently by exploiting BST order (per-query traversal) or by inorder-sorting the tree and binary searching the array.
Related questions
Continue with questions that share topics or the same question type.
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Balance a Binary Search Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2476. Closest Nodes Queries in a Binary Search Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source