Closest Binary Search Tree Value II: coding question

Available question text

Given a BST, a real-valued target and an integer k, return the k node values in the tree closest to the target. The challenge is to exploit BST ordering to produce those k nearest values efficiently (better than a full traversal), typically by generating sorted predecessors and successors and merging them.

Continue with questions that share topics or the same question type.

Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
Validate Binary Search Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
Binary Tree Inorder Traversal
Coding · Binary Tree · Depth-First Search · Stack

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 2 records

Amazon
Leetcode 272. Closest Binary Search Tree Value II
Reported Apr 20, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LinkedIn
Leetcode 272. Closest Binary Search Tree Value II
Reported Sep 1, 2026 · 4 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

LinkedIn
Closest Binary Search Tree Value II
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 62.6. This is not an interview probability.
View source
LinkedIn
Closest Binary Search Tree Value II

Available question text

Closest Binary Search Tree Value II

Available question text

Related questions

Closest Binary Search Tree Value II

Available question text

Related questions