Leetcode 270. Closest Binary Search Tree Value

Given a Binary Search Tree and a target numeric value, return the value of the node in the tree that is closest to the target. Leverage the BST ordering to traverse toward the target and maintain the best candidate (can be done in O(h) time, where h is tree height).

Asked at:

Meta

Question Timeline

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

Company

Level

Region

Mid November, 2025

Meta

Senior

Early October, 2025

Meta

Staff

Mid July, 2025

Meta

Mid-level

Get Premium to View All 7 Reports

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

Learn More

Leetcode 270. Closest Binary Search Tree Value

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact