Limited Time Offer:Up to 25% off Hello Interview Premium

Up to 25% off Hello Interview Premium 🎉

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Low Level Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

Sign in / Sign up

Search

⌘K

Pricing Become a Coach

Search

⌘K

Tutor

Get Premium

Leetcode 272. Closest Binary Search Tree Value II

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.

Asked at:

Amazon

LinkedIn

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late October, 2025

LinkedIn

Senior

Late April, 2025

Amazon

Mid-level

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content